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 08:08Adam FolwarcznyAdam FolwarcznyScore: 49,868Success
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 08:0948,638413,072,079402,688,0001,014,0002,113,536
2Jun 29, 2026 08:0949,054416,551,266406,062,0001,091,0002,113,536
3Jun 29, 2026 08:0949,180417,591,779406,997,0001,200,0002,113,536
4Jun 29, 2026 08:0949,432419,769,041409,036,0001,255,0002,113,536
5Jun 29, 2026 08:0949,868423,209,929412,838,0001,068,0002,113,536
6Jun 29, 2026 08:0949,929423,751,253413,341,0001,073,0002,113,536
7Jun 29, 2026 08:0949,996424,371,445413,933,0001,035,0002,113,536
8Jun 29, 2026 08:0950,067424,910,071414,302,0001,259,0002,113,536
9Jun 29, 2026 08:0950,105425,302,397414,765,0001,108,0002,113,536