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 listOct 19, 2026 18:31DanielDanielScore: 6,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 18:316,98268,817,50056,931,0001,027,0002,117,632
2Oct 19, 2026 18:316,98268,865,03356,936,0001,018,0002,117,632
3Oct 19, 2026 18:316,99068,923,07256,996,0001,027,0002,117,632
4Oct 19, 2026 18:316,99268,890,44057,009,0001,027,0002,117,632
5Oct 19, 2026 18:316,99269,095,05257,014,0001,027,0002,117,632
6Oct 19, 2026 18:317,07469,659,26257,696,0001,025,0002,117,632
7Oct 19, 2026 18:317,35371,951,17760,015,0001,021,0002,117,632
8Oct 19, 2026 18:317,35471,897,60160,026,0001,020,0002,117,632
9Oct 19, 2026 18:317,35772,001,86360,043,0001,021,0002,117,632