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 12, 2026 08:57Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 08:58039,908,25830,803,0001,124,0002,113,536expected "53691425988725706 ", got "53691643981828879 "
2May 12, 2026 08:583,82341,947,10230,641,0001,098,0002,113,536
3May 12, 2026 08:583,82942,102,08930,770,0001,018,0002,113,536
4May 12, 2026 08:583,83739,791,65930,767,0001,085,0002,113,536
5May 12, 2026 08:583,84040,966,80230,784,0001,093,0002,113,536
6May 12, 2026 08:583,85239,328,24330,902,0001,071,0002,113,536
7May 12, 2026 08:583,86141,123,38730,962,0001,090,0002,113,536
8May 12, 2026 08:583,87540,163,26531,057,0001,109,0002,113,536
9May 12, 2026 08:583,92243,279,74031,459,0001,095,0002,113,536