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 3, 2026 19:47Josu San MartinJosu San MartinScore: 10,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 19:479,89991,611,13175,420,0006,743,0002,117,632
2Jul 3, 2026 19:479,92091,721,31475,611,0006,725,0002,117,632
3Jul 3, 2026 19:479,92191,703,93775,623,0006,724,0002,121,728
4Jul 3, 2026 19:4710,00992,475,89876,262,0006,814,0002,117,632
5Jul 3, 2026 19:4710,01092,502,24076,245,0006,844,0002,121,728
6Jul 3, 2026 19:4710,01292,606,39976,280,0006,820,0002,121,728
7Jul 3, 2026 19:4710,01492,513,13676,316,0006,805,0002,121,728
8Jul 3, 2026 19:4710,03392,651,22876,284,0006,996,0002,121,728
9Jul 3, 2026 19:4710,04792,831,93776,509,0006,888,0002,117,632