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 11, 2026 08:05wnwnScore: 3,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 08:053,78239,074,99530,280,0001,117,0002,113,536
2May 11, 2026 08:053,78239,853,51830,282,0001,115,0002,113,536
3May 11, 2026 08:053,78339,557,28030,311,0001,092,0002,113,536
4May 11, 2026 08:053,78338,987,48430,349,0001,054,0002,113,536
5May 11, 2026 08:053,78338,950,38330,350,0001,051,0002,113,536
6May 11, 2026 08:053,78340,184,89430,313,0001,090,0002,113,536
7May 11, 2026 08:053,78439,317,70930,253,0001,160,0002,113,536
8May 11, 2026 08:053,78440,394,20630,329,0001,081,0002,113,536
9May 11, 2026 08:053,78542,101,91430,331,0001,085,0002,113,536