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 25, 2026 22:02Kevin HeaveyKevin HeaveyScore: 3,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 22:043,54639,428,20128,281,0001,158,0002,113,536
2Jul 25, 2026 22:043,55039,472,24028,311,0001,156,0002,113,536
3Jul 25, 2026 22:043,55639,543,15228,334,0001,185,0002,113,536
4Jul 25, 2026 22:043,56439,516,08628,434,0001,152,0002,113,536
5Jul 25, 2026 22:043,61040,297,42728,774,0001,192,0002,113,536
6Jul 25, 2026 22:043,72740,928,22029,780,0001,161,0002,113,536
7Jul 25, 2026 22:043,80241,560,57130,424,0001,136,0002,113,536
8Jul 25, 2026 22:043,82041,696,55130,554,0001,157,0002,113,536
9Jul 25, 2026 22:043,87542,101,24531,030,0001,140,0002,113,536