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 18:50Victor MerckléVictor MerckléScore: 6,957Success
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 18:506,95066,944,71857,690,00002,113,536
2May 15, 2026 18:506,95067,830,03556,684,0001,006,0002,113,536
3May 15, 2026 18:506,95267,355,87156,658,0001,046,0002,113,536
4May 15, 2026 18:506,95565,092,49956,724,0001,005,0002,113,536
5May 15, 2026 18:506,95766,148,97256,714,0001,034,0002,113,536
6May 15, 2026 18:506,95766,733,38056,712,0001,034,0002,113,536
7May 15, 2026 18:507,00765,758,74857,120,0001,044,0002,113,536
8May 15, 2026 18:507,01265,503,84957,159,0001,041,0002,113,536
9May 15, 2026 18:507,01367,985,15857,196,0001,012,0002,113,536