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 listJun 29, 2026 09:24Adam FolwarcznyAdam FolwarcznyScore: 14,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 09:2413,784134,302,805113,383,0001,025,0002,117,632
2Jun 29, 2026 09:2413,889132,213,786114,233,0001,049,0002,113,536
3Jun 29, 2026 09:2413,896124,710,769114,202,0001,139,0002,113,536
4Jun 29, 2026 09:2414,203127,272,767116,721,0001,169,0002,113,536
5Jun 29, 2026 09:2414,253134,460,092117,261,0001,044,0002,113,536
6Jun 29, 2026 09:2414,254127,655,788117,156,0001,158,0002,113,536
7Jun 29, 2026 09:2414,254127,608,999117,150,0001,165,0002,113,536
8Jun 29, 2026 09:2414,284127,888,198117,412,0001,148,0002,113,536
9Jun 29, 2026 09:2414,285128,489,697117,567,0001,006,0002,113,536