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 18, 2026 09:44Victor MerckléVictor MerckléScore: 6,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 09:446,97667,142,91856,887,0001,016,0002,113,536
2May 18, 2026 09:446,97667,598,05056,846,0001,057,0002,113,536
3May 18, 2026 09:446,97668,076,50756,844,0001,057,0002,113,536
4May 18, 2026 09:446,97767,739,19556,854,0001,062,0002,113,536
5May 18, 2026 09:446,97867,585,57356,863,0001,058,0002,113,536
6May 18, 2026 09:446,97968,428,93756,917,0001,011,0002,113,536
7May 18, 2026 09:446,97966,907,71956,850,0001,079,0002,113,536
8May 18, 2026 09:447,03566,810,58957,376,0001,022,0002,113,536
9May 18, 2026 09:447,03666,755,63957,333,0001,066,0002,113,536