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 15, 2026 05:37Victor MerckléVictor MerckléScore: 57,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 05:3756,667477,803,888469,221,0001,117,0002,117,632stderr
2May 15, 2026 05:3757,139482,510,558473,045,0001,215,0002,117,632stderr
3May 15, 2026 05:3757,158485,465,133473,232,0001,187,0002,117,632stderr
4May 15, 2026 05:3757,250484,738,558474,145,0001,036,0002,117,632stderr
5May 15, 2026 05:3757,273482,901,710474,261,0001,110,0002,117,632stderr
6May 15, 2026 05:3757,273482,823,668474,239,0001,132,0002,117,632stderr
7May 15, 2026 05:3757,277482,819,170474,291,0001,111,0002,117,632stderr
8May 15, 2026 05:3757,369483,479,311475,104,0001,063,0002,117,632stderr
9May 15, 2026 05:3757,382483,636,672475,212,0001,060,0002,117,632stderr