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 16:15Kevin HeaveyKevin HeaveyScore: 3,552Success
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 16:163,54339,240,99028,268,0001,147,0002,113,536
2Jul 22, 2026 16:163,54939,259,20628,357,0001,101,0002,113,536
3Jul 22, 2026 16:163,55039,348,37028,289,0001,177,0002,113,536
4Jul 22, 2026 16:163,55239,309,02828,328,0001,161,0002,113,536
5Jul 22, 2026 16:163,55239,356,38728,314,0001,175,0002,113,536
6Jul 22, 2026 16:163,55539,392,67828,293,0001,220,0002,113,536
7Jul 22, 2026 16:163,56639,460,21128,558,0001,045,0002,113,536
8Jul 22, 2026 16:163,57139,537,93228,505,0001,141,0002,113,536
9Jul 22, 2026 16:163,62639,999,31728,941,0001,159,0002,113,536