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 11, 2026 21:47Josu 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 11, 2026 21:47041,847,69631,679,0001,041,0002,113,536expected "53683260068498815 ", got "53683259812498815 "
2May 11, 2026 21:473,89941,939,37231,310,0001,059,0002,113,536
3May 11, 2026 21:473,90641,655,39231,381,0001,041,0002,113,536
4May 11, 2026 21:473,90740,539,61831,385,0001,048,0002,113,536
5May 11, 2026 21:473,91844,052,18831,463,0001,063,0002,113,536
6May 11, 2026 21:473,92140,689,13831,510,0001,040,0002,113,536
7May 11, 2026 21:473,93740,680,10731,638,0001,044,0002,113,536
8May 11, 2026 21:473,96340,600,62631,855,0001,045,0002,113,536
9May 11, 2026 21:474,03242,084,40932,344,0001,125,0002,113,536