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 10, 2026 03:41Josu 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 10, 2026 03:41054,233,81037,601,0001,092,0002,555,904expected "53692644330379704 ", got "53692644074379704 "
2May 10, 2026 03:41048,924,48335,591,0001,164,0002,560,000expected "53684061094947215 ", got "53684060838947215 "
3May 10, 2026 03:414,36148,460,05435,125,0001,079,0002,555,904
4May 10, 2026 03:414,37253,018,58835,117,0001,176,0002,551,808
5May 10, 2026 03:414,37954,448,64335,242,0001,105,0002,551,808
6May 10, 2026 03:414,37952,223,62335,245,0001,104,0002,555,904
7May 10, 2026 03:414,38653,064,11835,323,0001,087,0002,551,808
8May 10, 2026 03:414,44650,881,43935,861,0001,046,0002,555,904
9May 10, 2026 03:414,50154,555,27536,249,0001,117,0002,547,712