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 12, 2026 12:16Kevin HeaveyKevin HeaveyScore: 9,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 12:179,77790,695,16579,986,0001,167,0002,117,632
2Jul 12, 2026 12:179,81592,543,70080,457,0001,008,0002,117,632
3Jul 12, 2026 12:179,84991,431,98380,540,0001,210,0002,117,632
4Jul 12, 2026 12:179,86191,417,43180,661,0001,188,0002,117,632
5Jul 12, 2026 12:179,89991,770,77180,955,0001,209,0002,117,632
6Jul 12, 2026 12:179,90491,857,34281,021,0001,183,0002,117,632
7Jul 12, 2026 12:179,93092,015,25081,249,0001,176,0002,117,632
8Jul 12, 2026 12:179,94892,239,21281,370,0001,202,0002,117,632
9Jul 12, 2026 12:1710,10093,545,16882,633,0001,203,0002,117,632