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 20, 2026 21:16Kevin HeaveyKevin HeaveyScore: 9,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 21:179,57489,152,21376,836,0002,633,0002,117,632
2Jul 20, 2026 21:179,58489,211,70276,952,0002,599,0002,117,632
3Jul 20, 2026 21:179,72791,094,68278,030,0002,706,0002,117,632
4Jul 20, 2026 21:179,91892,014,47479,749,0002,572,0002,117,632
5Jul 20, 2026 21:179,99692,749,19980,252,0002,722,0002,117,632
6Jul 20, 2026 21:1710,25894,823,85182,552,0002,593,0002,117,632
7Jul 20, 2026 21:1720,571180,454,102168,084,0002,660,0002,117,632
8Jul 20, 2026 21:1720,749181,981,634169,595,0002,629,0002,117,632
9Jul 20, 2026 21:1720,775182,165,152169,768,0002,667,0002,117,632