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 listMar 10, 2026 18:51Josu San MartinJosu San MartinScore: 7,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:516,59283,135,90747,751,0006,963,0002,387,968
2Mar 10, 2026 18:516,81489,159,01051,505,0005,049,0002,285,568
3Mar 10, 2026 18:516,95291,249,57550,737,0006,963,0002,301,952
4Mar 10, 2026 18:517,88292,192,81055,358,00010,065,0002,318,336
5Mar 10, 2026 18:517,90395,788,04760,623,0004,969,0002,478,080
6Mar 10, 2026 18:518,06291,741,29660,925,0005,992,0002,351,104