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 17, 2026 00:37Kevin HeaveyKevin HeaveyScore: 3,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 00:423,69040,445,56729,577,0001,050,0002,113,536
2Jul 17, 2026 00:423,70940,528,01329,738,0001,051,0002,113,536
3Jul 17, 2026 00:423,71440,719,07529,785,0001,048,0002,113,536
4Jul 17, 2026 00:423,72440,643,08229,863,0001,051,0002,113,536
5Jul 17, 2026 00:423,75940,986,75930,153,0001,050,0002,113,536
6Jul 17, 2026 00:423,84741,728,46230,889,0001,047,0002,113,536
7Jul 17, 2026 00:424,03543,904,42732,445,0001,047,0002,113,536
8Jul 17, 2026 00:424,04843,394,75832,553,0001,046,0002,113,536
9Jul 17, 2026 00:424,06843,471,16432,723,0001,043,0002,113,536