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 18, 2026 16:33Kevin HeaveyKevin HeaveyScore: 3,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 16:403,70440,501,82629,703,0001,046,0002,113,536
2Jul 18, 2026 16:403,81941,751,24330,656,0001,048,0002,113,536
3Jul 18, 2026 16:403,83250,742,39230,757,0001,049,0002,117,632
4Jul 18, 2026 16:403,95442,622,99831,774,0001,047,0002,113,536
5Jul 18, 2026 16:403,96043,251,62831,830,0001,046,0002,113,536
6Jul 18, 2026 16:403,97443,370,64831,946,0001,045,0002,113,536
7Jul 18, 2026 16:403,98452,629,80732,032,0001,043,0002,113,536
8Jul 18, 2026 16:403,99543,565,39932,119,0001,046,0002,113,536
9Jul 18, 2026 16:404,04243,387,20132,507,0001,046,0002,113,536