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 15, 2026 01:14Kevin HeaveyKevin HeaveyScore: 3,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 01:163,68940,264,12329,410,0001,212,0002,117,632
2Jul 15, 2026 01:163,69940,366,38029,422,0001,281,0002,117,632
3Jul 15, 2026 01:163,70740,412,93529,748,0001,027,0002,117,632
4Jul 15, 2026 01:163,70840,429,29629,520,0001,261,0002,117,632
5Jul 15, 2026 01:163,72140,520,69729,862,0001,027,0002,117,632
6Jul 15, 2026 01:163,74040,806,86730,008,0001,038,0002,117,632
7Jul 15, 2026 01:163,75440,777,09329,935,0001,226,0002,117,632
8Jul 15, 2026 01:163,75540,717,31730,132,0001,038,0002,117,632
9Jul 15, 2026 01:163,76240,854,99430,187,0001,039,0002,117,632