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 listFeb 3, 2026 08:59promix1722promix1722Score: 81,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 08:5981,148698,487,599610,573,00062,956,0002,289,664
2Feb 3, 2026 08:5981,229701,559,073616,183,00058,017,0002,265,088
3Feb 3, 2026 08:5981,273697,975,526610,610,00063,959,0002,293,760
4Feb 3, 2026 08:5981,282697,550,463609,674,00064,965,0002,523,136
5Feb 3, 2026 08:5981,374701,720,940614,367,00061,036,0002,383,872
6Feb 3, 2026 08:5981,420702,565,046609,809,00065,979,0002,289,664
7Feb 3, 2026 08:5981,460704,987,011615,111,00061,011,0002,265,088
8Feb 3, 2026 08:5981,506705,152,239610,547,00065,951,0002,293,760
9Feb 3, 2026 08:5981,544699,738,590611,833,00064,982,0002,269,184