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 9, 2026 23:11Elnur RakhmatullinElnur RakhmatullinScore: 13,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 23:1113,482121,539,404110,745,0001,157,0002,113,536
2Jul 9, 2026 23:1113,502121,694,377110,933,0001,140,0002,113,536
3Jul 9, 2026 23:1113,603122,606,013111,773,0001,139,0002,113,536
4Jul 9, 2026 23:1113,621122,785,888111,924,0001,138,0002,113,536
5Jul 9, 2026 23:1113,837124,897,870113,684,0001,168,0002,113,536
6Jul 9, 2026 23:1113,904125,028,862114,254,0001,150,0002,113,536
7Jul 9, 2026 23:1113,916125,759,730114,498,0001,012,0002,113,536
8Jul 9, 2026 23:1113,943125,967,037114,574,0001,161,0002,113,536
9Jul 9, 2026 23:1113,956125,577,256114,741,0001,099,0002,113,536