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 21, 2026 14:47Victor MerckléVictor MerckléScore: 4,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 14:484,56445,725,54636,823,0001,060,0002,113,536
2May 21, 2026 14:484,56447,812,03836,803,0001,086,0002,113,536
3May 21, 2026 14:484,58646,366,05636,965,0001,102,0002,113,536
4May 21, 2026 14:484,59047,222,49237,085,0001,014,0002,113,536
5May 21, 2026 14:484,59047,811,48537,103,0001,001,0002,113,536
6May 21, 2026 14:484,59846,165,57837,134,0001,035,0002,113,536
7May 21, 2026 14:484,60446,045,21037,181,0001,037,0002,113,536
8May 21, 2026 14:484,80549,400,27338,859,0001,024,0002,113,536
9May 21, 2026 14:484,88248,978,42439,454,0001,074,0002,113,536