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 18, 2026 11:21Victor MerckléVictor MerckléScore: 6,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 11:226,72866,888,73954,698,0001,148,0002,113,536
2May 18, 2026 11:226,72966,904,06854,808,0001,045,0002,113,536
3May 18, 2026 11:226,73066,161,08954,845,0001,014,0002,113,536
4May 18, 2026 11:226,73268,259,42754,843,0001,035,0002,113,536
5May 18, 2026 11:226,73365,451,41354,836,0001,048,0002,113,536
6May 18, 2026 11:226,74067,361,18654,904,0001,046,0002,113,536
7May 18, 2026 11:226,76265,376,44955,070,0001,058,0002,113,536
8May 18, 2026 11:226,76365,326,63955,014,0001,122,0002,113,536
9May 18, 2026 11:226,76671,331,72854,998,0001,168,0002,113,536