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:50Kevin HeaveyKevin HeaveyScore: 3,849Success
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:553,70940,490,04329,744,0001,048,0002,113,536
2Jul 17, 2026 00:553,71640,658,67929,794,0001,051,0002,113,536
3Jul 17, 2026 00:553,73240,778,71929,926,0001,050,0002,113,536
4Jul 17, 2026 00:553,74040,798,91729,996,0001,052,0002,113,536
5Jul 17, 2026 00:553,84941,670,79030,899,0001,048,0002,113,536
6Jul 17, 2026 00:553,85041,746,33130,911,0001,050,0002,113,536
7Jul 17, 2026 00:553,87243,656,12831,092,0001,047,0002,113,536
8Jul 17, 2026 00:553,96442,972,40431,858,0001,046,0002,113,536
9Jul 17, 2026 00:554,01243,057,94432,281,0001,025,0002,113,536