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 18, 2026 00:32olliecrowolliecrowScore: 5,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 00:325,65581,729,55842,940,0003,994,0002,285,568
2Feb 18, 2026 00:325,66874,690,34146,047,0001,001,0002,400,256
3Feb 18, 2026 00:325,69576,818,00143,243,0004,022,0002,359,296
4Feb 18, 2026 00:325,83873,894,92847,445,0001,009,0002,453,504
5Feb 18, 2026 00:325,87181,082,82544,749,0003,977,0002,498,560
6Feb 18, 2026 00:325,89280,088,18545,909,0002,994,0002,351,104
7Feb 18, 2026 00:325,93274,382,73445,220,0004,019,0002,514,944
8Feb 18, 2026 00:325,93372,874,07346,228,0003,014,0002,437,120
9Feb 18, 2026 00:325,93976,874,97345,270,0004,024,0002,363,392
10Feb 18, 2026 00:325,95175,715,60146,367,0003,023,0002,469,888
11Feb 18, 2026 00:325,96772,853,48248,518,0001,010,0002,330,624
12Feb 18, 2026 00:326,00182,312,90846,819,0002,988,0002,387,968