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 3, 2026 22:39Victor MerckléVictor MerckléScore: 5,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:405,46654,500,16144,307,0001,067,0002,117,632stderr
2Sep 3, 2026 22:405,46953,850,74844,329,0001,071,0002,117,632stderr
3Sep 3, 2026 22:405,47053,848,56244,341,0001,066,0002,117,632stderr
4Sep 3, 2026 22:405,47653,891,67144,368,0001,085,0002,117,632stderr
5Sep 3, 2026 22:405,47753,936,84744,379,0001,088,0002,117,632stderr
6Sep 3, 2026 22:405,48053,943,20744,445,0001,039,0002,117,632stderr
7Sep 3, 2026 22:405,48453,944,22844,511,0001,007,0002,117,632stderr
8Sep 3, 2026 22:405,50054,123,56044,371,0001,279,0002,117,632stderr
9Sep 3, 2026 22:405,52254,270,77944,777,0001,062,0002,117,632stderr