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 6, 2026 10:09Kevin HeaveyKevin HeaveyScore: 5,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 10:125,07551,705,46240,859,0001,267,0002,117,632
2Jul 6, 2026 10:125,08351,613,04841,177,0001,017,0002,117,632
3Jul 6, 2026 10:125,09351,766,94041,042,0001,234,0002,117,632
4Jul 6, 2026 10:125,11051,940,78241,186,0001,230,0002,117,632
5Jul 6, 2026 10:125,12252,010,78041,286,0001,228,0002,117,632
6Jul 6, 2026 10:125,18352,973,85941,763,0001,260,0002,117,632
7Jul 6, 2026 10:125,18552,569,87041,783,0001,256,0002,117,632
8Jul 6, 2026 10:125,22354,473,37142,092,0001,265,0002,117,632
9Jul 6, 2026 10:125,67356,618,69846,074,0001,018,0002,117,632