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 13, 2026 13:24Eric CeglieEric CeglieScore: 209,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 13:22208,6681,760,060,9341,729,948,0001,998,0002,514,944
2Mar 13, 2026 13:22209,6531,769,944,5561,738,120,0001,998,0002,519,040
3Mar 13, 2026 13:24209,6701,766,127,4961,738,260,0001,999,0002,383,872
4Mar 13, 2026 13:24209,6781,770,509,8481,739,325,000999,0002,383,872
5Mar 13, 2026 13:22209,7171,767,388,2951,737,652,0002,997,0002,392,064
6Mar 13, 2026 13:24209,7261,766,237,8781,739,726,000999,0002,379,776