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 01:36Victor MerckléVictor MerckléScore: 6,956Success
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 01:366,95167,035,04157,700,00002,113,536
2May 16, 2026 01:366,95266,879,91157,708,00002,113,536
3May 16, 2026 01:366,95565,899,79956,718,0001,013,0002,113,536
4May 16, 2026 01:366,95566,215,85156,721,0001,008,0002,113,536
5May 16, 2026 01:366,95666,966,59256,733,0001,006,0002,113,536
6May 16, 2026 01:366,95866,978,45057,755,00002,113,536
7May 16, 2026 01:366,95965,345,58056,743,0001,017,0002,113,536
8May 16, 2026 01:366,96165,192,52456,754,0001,026,0002,113,536
9May 16, 2026 01:367,00666,276,80558,153,00002,113,536