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 16, 2026 09:02boop34boop34Score: 9,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 09:039,00284,346,12873,703,0001,019,0002,113,536
2Jul 16, 2026 09:039,01584,391,52473,820,0001,006,0002,113,536
3Jul 16, 2026 09:039,01685,668,41473,781,0001,054,0002,113,536
4Jul 16, 2026 09:039,02486,428,10773,892,0001,011,0002,113,536
5Jul 16, 2026 09:039,03184,491,15973,859,0001,099,0002,113,536
6Jul 16, 2026 09:039,03584,573,57873,988,0001,005,0002,113,536
7Jul 16, 2026 09:039,06584,829,38574,230,0001,010,0002,113,536
8Jul 16, 2026 09:039,07084,864,25074,279,0001,007,0002,113,536
9Jul 16, 2026 09:039,16492,782,52975,020,0001,045,0002,113,536