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 listApr 11, 2026 18:43Josu San MartinJosu San MartinScore: 5,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 18:435,24367,967,08542,504,0001,012,0002,404,352
2Apr 11, 2026 18:435,24569,088,28842,519,0001,012,0002,408,448
3Apr 11, 2026 18:435,28074,902,14542,828,000996,0002,396,160
4Apr 11, 2026 18:435,29865,516,90139,977,0003,997,0002,281,472
5Apr 11, 2026 18:435,32768,013,27742,209,0002,009,0002,404,352
6Apr 11, 2026 18:435,38072,993,29242,623,0002,029,0002,400,256