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 16, 2026 00:55Victor MerckléVictor MerckléScore: 6,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 00:566,94864,981,78856,675,0001,001,0002,113,536
2May 16, 2026 00:566,94965,402,63357,681,00002,113,536
3May 16, 2026 00:566,94965,238,09457,680,00002,113,536
4May 16, 2026 00:566,95167,154,08957,694,00002,113,536
5May 16, 2026 00:566,95367,813,58857,714,00002,113,536
6May 16, 2026 00:566,95765,847,57756,741,0001,008,0002,113,536
7May 16, 2026 00:566,95765,285,01656,733,0001,014,0002,113,536
8May 16, 2026 00:566,96366,811,22356,702,0001,092,0002,113,536
9May 16, 2026 00:567,00165,492,27558,110,00002,113,536