Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 1, 2026 01:03olliecrowolliecrowScore: 6,190Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 01:036,11566,390,17948,767,0001,990,0002,326,528
2May 1, 2026 01:036,18465,616,68346,296,0005,032,0002,326,528
3May 1, 2026 01:036,18568,755,69148,323,0003,020,0002,301,952
4May 1, 2026 01:036,18667,882,65547,317,0004,027,0002,523,136
5May 1, 2026 01:036,19066,745,38149,367,0002,015,0002,330,624
6May 1, 2026 01:036,19566,072,02249,367,0002,056,0002,514,944
7May 1, 2026 01:036,20864,411,09749,507,0002,020,0002,490,368
8May 1, 2026 01:036,23972,160,71748,803,0002,987,0002,539,520
9May 1, 2026 01:036,23968,759,04248,802,0002,987,0002,347,008