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 listSep 6, 2026 10:30Kevin HeaveyKevin HeaveyScore: 3,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:313,54739,392,52228,400,0001,043,0002,113,536
2Sep 6, 2026 10:313,55637,857,13428,315,0001,201,0002,113,536
3Sep 6, 2026 10:313,58138,311,49928,476,0001,248,0002,113,536
4Sep 6, 2026 10:313,66039,019,19029,347,0001,039,0002,113,536
5Sep 6, 2026 10:313,74239,615,72430,006,0001,057,0002,113,536
6Sep 6, 2026 10:313,78139,972,69330,163,0001,222,0002,113,536
7Sep 6, 2026 10:313,79240,078,44130,361,0001,120,0002,113,536
8Sep 6, 2026 10:313,82740,214,28730,727,0001,043,0002,113,536
9Sep 6, 2026 10:313,83241,930,01430,756,0001,056,0002,113,536