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 22, 2026 10:53Kevin HeaveyKevin HeaveyScore: 4,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 11:003,94142,621,60729,605,0003,110,0002,121,728
2Jul 22, 2026 11:003,97348,039,87729,856,0003,127,0002,121,728
3Jul 22, 2026 11:003,97642,925,48529,838,0003,166,0002,121,728
4Jul 22, 2026 11:004,08147,991,93830,644,0003,232,0002,121,728
5Jul 22, 2026 11:004,13744,250,37231,079,0003,262,0002,125,824
6Jul 22, 2026 11:004,17444,553,85031,435,0003,217,0002,117,632
7Jul 22, 2026 11:004,19950,721,12631,658,0003,198,0002,121,728
8Jul 22, 2026 11:004,20345,484,84431,601,0003,285,0002,121,728
9Jul 22, 2026 11:004,23945,065,86132,037,0003,154,0002,121,728