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 20:49Kevin HeaveyKevin HeaveyScore: 3,634Success
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 20:503,62539,586,01228,931,0001,158,0002,113,536
2Jul 20, 2026 20:503,63039,719,87529,089,0001,046,0002,113,536
3Jul 20, 2026 20:503,63239,803,25328,919,0001,234,0002,113,536
4Jul 20, 2026 20:503,63239,728,16629,001,0001,148,0002,113,536
5Jul 20, 2026 20:503,63439,767,90729,011,0001,159,0002,113,536
6Jul 20, 2026 20:503,64039,783,77629,083,0001,130,0002,113,536
7Jul 20, 2026 20:503,64939,866,51429,147,0001,143,0002,113,536
8Jul 20, 2026 20:503,65839,941,55229,152,0001,210,0002,113,536
9Jul 20, 2026 20:503,67039,980,18629,307,0001,155,0002,113,536