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 listFeb 18, 2026 18:20wnwnScore: 7,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:206,43776,542,13852,420,0001,008,0002,523,136
2Feb 18, 2026 18:206,44976,876,39951,505,0002,019,0002,523,136
3Feb 18, 2026 18:206,60378,875,03252,813,0001,992,0002,523,136
4Feb 18, 2026 18:207,46084,405,24459,919,0001,997,0002,449,408
5Feb 18, 2026 18:207,47585,985,65759,040,0003,002,0002,310,144
6Feb 18, 2026 18:207,82189,201,40362,917,0001,997,0002,404,352