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 15, 2026 01:20Kevin HeaveyKevin HeaveyScore: 3,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 01:213,67540,087,76429,325,0001,179,0002,117,632
2Jul 15, 2026 01:213,69340,357,11129,633,0001,026,0002,117,632
3Jul 15, 2026 01:213,69640,319,99029,654,0001,026,0002,117,632
4Jul 15, 2026 01:213,74840,776,61429,890,0001,220,0002,117,632
5Jul 15, 2026 01:213,75040,732,81629,909,0001,220,0002,117,632
6Jul 15, 2026 01:213,75540,853,30529,946,0001,225,0002,117,632
7Jul 15, 2026 01:213,76642,443,10030,223,0001,036,0002,117,632
8Jul 15, 2026 01:213,77440,978,48830,287,0001,038,0002,117,632
9Jul 15, 2026 01:213,77940,994,40230,322,0001,047,0002,117,632