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 listJul 14, 2026 21:17Kevin HeaveyKevin HeaveyScore: 3,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:193,69540,378,84029,642,0001,030,0002,117,632
2Jul 14, 2026 21:193,70640,351,88529,735,0001,026,0002,117,632
3Jul 14, 2026 21:193,71640,434,91929,816,0001,028,0002,117,632
4Jul 14, 2026 21:193,73340,614,93629,960,0001,025,0002,117,632
5Jul 14, 2026 21:193,77740,953,65230,309,0001,042,0002,117,632
6Jul 14, 2026 21:193,78541,039,27330,378,0001,042,0002,117,632
7Jul 14, 2026 21:193,78841,103,37430,405,0001,041,0002,117,632
8Jul 14, 2026 21:193,79241,019,94930,427,0001,049,0002,117,632
9Jul 14, 2026 21:193,81241,232,94530,607,0001,040,0002,117,632