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 9, 2026 13:12wnwnScore: 4,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 13:123,98449,571,94031,988,0001,081,0002,490,368
2May 9, 2026 13:123,99548,430,60432,098,0001,063,0002,486,272
3May 9, 2026 13:124,06247,762,33332,645,0001,070,0002,486,272
4May 9, 2026 13:124,06449,750,25332,672,0001,066,0002,486,272
5May 9, 2026 13:124,06650,555,63132,639,0001,111,0002,330,624
6May 9, 2026 13:124,07547,084,98832,739,0001,084,0002,478,080
7May 9, 2026 13:124,07649,219,90432,792,0001,042,0002,490,368
8May 9, 2026 13:124,12650,740,30233,121,0001,127,0002,478,080
9May 9, 2026 13:124,14950,383,44433,363,0001,075,0002,490,368