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 11:22Adam FolwarcznyAdam FolwarcznyScore: 11,653Success
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 11:2211,543105,319,85292,633,0003,178,0002,117,632stderr
2Jun 29, 2026 11:2211,557105,500,98892,881,0003,049,0002,117,632stderr
3Jun 29, 2026 11:2211,560105,622,71992,711,0003,243,0002,117,632stderr
4Jun 29, 2026 11:2211,567105,719,35292,730,0003,279,0002,117,632stderr
5Jun 29, 2026 11:2211,653106,334,02093,460,0003,260,0002,117,632stderr
6Jun 29, 2026 11:2211,655106,353,89093,489,0003,249,0002,117,632stderr
7Jun 29, 2026 11:2211,677106,428,91492,768,0004,154,0002,117,632stderr
8Jun 29, 2026 11:2211,712106,797,90793,201,0004,010,0002,117,632stderr
9Jun 29, 2026 11:2211,759107,265,36294,338,0003,267,0002,117,632stderr