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 14, 2026 16:38Kevin 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 14, 2026 16:393,67341,519,24229,464,0001,028,0002,117,632
2Jul 14, 2026 16:393,68140,194,01429,533,0001,024,0002,117,632
3Jul 14, 2026 16:393,70340,371,93729,711,0001,027,0002,117,632
4Jul 14, 2026 16:393,71540,553,86929,806,0001,033,0002,117,632
5Jul 14, 2026 16:393,72140,587,37729,859,0001,029,0002,117,632
6Jul 14, 2026 16:393,75340,797,55030,136,0001,022,0002,117,632
7Jul 14, 2026 16:393,76040,845,67930,172,0001,040,0002,117,632
8Jul 14, 2026 16:393,76240,808,07830,188,0001,044,0002,117,632
9Jul 14, 2026 16:393,79241,133,40130,429,0001,048,0002,117,632