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 24, 2026 20:49Kevin HeaveyKevin HeaveyScore: 3,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 20:503,60139,773,07928,718,0001,173,0002,113,536
2Jul 24, 2026 20:503,60839,845,35828,790,0001,161,0002,113,536
3Jul 24, 2026 20:503,62339,885,05028,920,0001,155,0002,113,536
4Jul 24, 2026 20:503,63039,946,31228,949,0001,181,0002,113,536
5Jul 24, 2026 20:503,64046,069,52429,059,0001,158,0002,113,536
6Jul 24, 2026 20:503,66340,268,32029,224,0001,179,0002,113,536
7Jul 24, 2026 20:503,69340,485,52929,509,0001,143,0002,113,536
8Jul 24, 2026 20:503,74340,902,41729,947,0001,126,0002,113,536
9Jul 24, 2026 20:503,81941,542,33430,544,0001,156,0002,113,536