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 15, 2026 04:37Victor MerckléVictor MerckléScore: 34,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 04:4234,121291,402,198282,168,0001,039,0002,117,632stderr
2Jul 15, 2026 04:4234,190292,429,373282,763,0001,022,0002,117,632stderr
3Jul 15, 2026 04:4234,191291,863,789282,770,0001,019,0002,117,632stderr
4Jul 15, 2026 04:4234,246292,367,778283,243,0001,001,0002,117,632stderr
5Jul 15, 2026 04:4234,272292,563,717283,258,0001,201,0002,117,632stderr
6Jul 15, 2026 04:4234,283292,764,291283,509,0001,048,0002,117,632stderr
7Jul 15, 2026 04:4234,299292,820,518283,658,0001,028,0002,117,632stderr
8Jul 15, 2026 04:4234,349293,390,696283,842,0001,261,0002,117,632stderr
9Jul 15, 2026 04:4234,381294,830,049284,071,0001,296,0002,117,632stderr