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 24, 2026 03:08wnwnScore: 3,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:083,29936,195,87227,382,000020,480
2Sep 24, 2026 03:083,31236,275,87227,497,000020,480
3Sep 24, 2026 03:083,32136,319,03027,570,000020,480
4Sep 24, 2026 03:083,33536,521,15126,647,0001,035,0002,113,536
5Sep 24, 2026 03:083,34436,582,92626,751,0001,010,0002,113,536
6Sep 24, 2026 03:083,35336,638,09926,820,0001,017,0002,113,536
7Sep 24, 2026 03:083,38036,855,41128,060,000020,480
8Sep 24, 2026 03:083,46137,519,25828,728,000020,480
9Sep 24, 2026 03:083,46437,527,41528,758,000020,480