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 15, 2026 23:52Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 23:52066,038,81156,759,0001,029,0002,113,536expected "53681973936931720 ", got "53681971632931720 "
2May 15, 2026 23:526,94868,062,31456,657,0001,019,0002,113,536
3May 15, 2026 23:526,95066,468,43056,676,0001,009,0002,113,536
4May 15, 2026 23:526,95066,836,92756,686,0001,005,0002,113,536
5May 15, 2026 23:526,95768,210,82556,706,0001,045,0002,113,536
6May 15, 2026 23:526,96067,533,59556,756,0001,013,0002,113,536
7May 15, 2026 23:527,00665,475,60958,157,00002,113,536
8May 15, 2026 23:527,01166,772,65957,192,0001,007,0002,113,536
9May 15, 2026 23:527,03266,666,68957,347,0001,024,0002,113,536