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 22, 2026 07:49Victor MerckléVictor MerckléScore: 4,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 07:494,55645,667,62436,755,0001,060,0002,113,536
2May 22, 2026 07:494,56547,388,16436,825,0001,068,0002,113,536
3May 22, 2026 07:494,56547,479,28136,822,0001,072,0002,113,536
4May 22, 2026 07:494,57045,780,90336,865,0001,067,0002,113,536
5May 22, 2026 07:494,57545,909,46136,902,0001,074,0002,113,536
6May 22, 2026 07:494,57945,818,69836,977,0001,030,0002,113,536
7May 22, 2026 07:494,58147,741,28037,016,0001,010,0002,113,536
8May 22, 2026 07:494,58647,664,20536,979,0001,091,0002,113,536
9May 22, 2026 07:494,61948,293,72037,335,0001,007,0002,113,536