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 20:05Josu San MartinJosu San MartinScore: 10,389Success
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 20:0510,29694,821,73178,886,0006,574,0002,121,728
2Jul 3, 2026 20:0510,30794,878,42378,879,0006,676,0002,121,728
3Jul 3, 2026 20:0510,31895,008,26778,790,0006,850,0002,121,728
4Jul 3, 2026 20:0510,35095,245,78379,199,0006,713,0002,117,632
5Jul 3, 2026 20:0510,38995,904,60979,400,0006,830,0002,117,632
6Jul 3, 2026 20:0510,43397,473,88179,623,0006,971,0002,117,632
7Jul 3, 2026 20:0510,44496,054,70279,947,0006,739,0002,121,728
8Jul 3, 2026 20:0511,396103,991,75287,773,0006,817,0002,121,728
9Jul 3, 2026 20:0511,437104,260,06088,138,0006,793,0002,117,632