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 24, 2026 16:17Victor MerckléVictor MerckléScore: 12,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 16:1712,228109,472,795100,467,0001,029,0002,113,536
2May 24, 2026 16:1712,231110,365,701100,486,0001,037,0002,113,536
3May 24, 2026 16:1712,234109,932,077100,520,0001,026,0002,113,536
4May 24, 2026 16:1712,239110,318,707100,561,0001,027,0002,113,536
5May 24, 2026 16:1712,248110,952,500100,637,0001,026,0002,113,536
6May 24, 2026 16:1712,343112,127,956101,444,0001,006,0002,113,536
7May 24, 2026 16:1712,405112,401,312101,895,0001,073,0002,113,536
8May 24, 2026 16:1712,405112,685,041101,929,0001,039,0002,113,536
9May 24, 2026 16:1712,593113,098,745103,486,0001,039,0002,113,536