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 27, 2026 02:04Kevin HeaveyKevin HeaveyScore: 3,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 02:063,68540,619,31129,435,0001,153,0002,113,536
2Jul 27, 2026 02:063,69240,696,93829,414,0001,236,0002,113,536
3Jul 27, 2026 02:063,69840,881,54929,518,0001,181,0002,113,536
4Jul 27, 2026 02:063,69940,842,37029,660,0001,043,0002,113,536
5Jul 27, 2026 02:063,71340,906,70329,672,0001,148,0002,113,536
6Jul 27, 2026 02:063,72641,055,08729,763,0001,166,0002,113,536
7Jul 27, 2026 02:063,72941,014,77429,800,0001,151,0002,113,536
8Jul 27, 2026 02:063,77041,338,63630,122,0001,177,0002,113,536
9Jul 27, 2026 02:064,05043,713,16032,468,0001,149,0002,113,536