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 listMar 10, 2026 14:47JarnoJarnoScore: 55,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 14:4755,891490,004,725461,899,0001,999,0002,367,488
2Mar 10, 2026 14:4755,891492,119,828462,894,000999,0002,285,568
3Mar 10, 2026 14:4755,893486,649,440462,910,000999,0002,285,568
4Mar 10, 2026 14:4755,905485,969,116463,008,0001,000,0002,281,472
5Mar 10, 2026 14:4755,905491,118,825462,013,0002,000,0002,363,392
6Mar 10, 2026 14:4755,906484,602,789462,021,0002,000,0002,281,472
7Mar 10, 2026 14:4755,908490,159,885463,037,0001,000,0002,285,568
8Mar 10, 2026 14:4755,917492,331,305462,108,0002,000,0002,285,568
9Mar 10, 2026 14:4755,920486,186,565463,136,0001,000,0002,281,472