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 listMar 10, 2026 16:11Josu San MartinJosu San MartinScore: 5,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 16:115,03972,815,32739,831,0001,991,0002,408,448
2Mar 10, 2026 16:115,18371,799,57741,016,0002,000,0002,281,472
3Mar 10, 2026 16:115,25668,359,01842,608,0001,014,0002,412,544
4Mar 10, 2026 16:115,27968,666,70041,821,0001,991,0002,281,472
5Mar 10, 2026 16:115,35268,397,56243,412,0001,009,0002,408,448
6Mar 10, 2026 16:115,35674,502,82343,444,0001,010,0002,281,472