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 listSep 17, 2026 01:12Andrew EpsteinAndrew EpsteinScore: 49,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:1248,721414,753,289403,382,0001,005,0002,117,632stderr
2Sep 17, 2026 01:1248,877415,904,927404,676,0001,009,0002,117,632stderr
3Sep 17, 2026 01:1248,952416,508,207405,294,0001,009,0002,117,632stderr
4Sep 17, 2026 01:1249,026417,123,976405,912,0001,008,0002,117,632stderr
5Sep 17, 2026 01:1249,053417,374,665406,142,0001,001,0002,117,632stderr
6Sep 17, 2026 01:1249,075417,599,241406,323,0001,005,0002,117,632stderr
7Sep 17, 2026 01:1249,220418,747,134407,525,0001,001,0002,117,632stderr
8Sep 17, 2026 01:1249,337419,793,832408,494,0001,007,0002,117,632stderr
9Sep 17, 2026 01:1249,513421,238,344409,958,0001,006,0002,117,632stderr