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 23, 2026 19:40wnwnScore: 5,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 19:405,03971,800,85740,829,000995,0002,494,464
2Feb 23, 2026 19:405,06963,416,15940,067,0002,003,0002,535,424
3Feb 23, 2026 19:405,07269,504,36640,092,0002,004,0002,535,424
4Feb 23, 2026 19:405,07265,291,09140,096,0002,004,0002,494,464
5Feb 23, 2026 19:405,10164,989,43541,333,0001,008,0002,535,424
6Feb 23, 2026 19:405,12870,077,79641,548,0001,013,0002,277,376