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 listSep 17, 2026 02:28Andrew EpsteinAndrew EpsteinScore: 5,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:284,97651,729,28439,229,0002,077,0002,121,728stderr
2Sep 17, 2026 02:284,98351,984,38339,273,0002,088,0002,121,728stderr
3Sep 17, 2026 02:284,99451,781,14839,383,0002,072,0002,121,728stderr
4Sep 17, 2026 02:285,01051,930,84839,518,0002,065,0002,121,728stderr
5Sep 17, 2026 02:285,13153,514,29040,498,0002,093,0002,121,728stderr
6Sep 17, 2026 02:285,13553,713,17840,536,0002,086,0002,121,728stderr
7Sep 17, 2026 02:285,18254,369,16840,934,0002,078,0002,121,728stderr
8Sep 17, 2026 02:285,18354,022,48140,939,0002,084,0002,121,728stderr
9Sep 17, 2026 02:285,18954,195,47840,984,0002,091,0002,121,728stderr