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 14, 2026 21:29Victor MerckléVictor MerckléScore: 58,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 21:3058,659495,363,416485,868,0001,005,0002,117,632stderr
2May 14, 2026 21:3058,660494,241,420485,881,0001,003,0002,117,632stderr
3May 14, 2026 21:3058,661494,422,957485,885,0001,005,0002,117,632stderr
4May 14, 2026 21:3058,666494,117,732485,932,0001,003,0002,117,632stderr
5May 14, 2026 21:3058,667494,101,453485,939,0001,005,0002,117,632stderr
6May 14, 2026 21:3058,669494,566,231485,955,0001,005,0002,117,632stderr
7May 14, 2026 21:3058,675496,252,469486,002,0001,005,0002,117,632stderr
8May 14, 2026 21:3058,678496,593,649486,025,0001,005,0002,117,632stderr
9May 14, 2026 21:3058,680494,294,795486,044,0001,005,0002,117,632stderr