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 16, 2026 21:36zielajzielajScore: 3,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 21:363,48252,643,33826,905,0001,993,0002,437,120
2Mar 16, 2026 21:363,48852,855,15226,958,0001,996,0002,433,024
3Mar 16, 2026 21:363,49752,882,34526,024,0003,002,0002,519,040
4Mar 16, 2026 21:363,49848,226,54027,028,0002,002,0002,514,944
5Mar 16, 2026 21:363,49855,848,50827,031,0002,002,0002,506,752
6Mar 16, 2026 21:363,50251,193,98927,065,0002,004,0002,514,944
7Mar 16, 2026 21:363,50251,851,82327,066,0002,004,0002,437,120
8Mar 16, 2026 21:363,50350,406,79627,068,0002,005,0002,478,080
9Mar 16, 2026 21:363,51753,856,73627,177,0002,013,0002,519,040
10Mar 16, 2026 21:363,52350,250,81727,224,0002,016,0002,514,944
11Mar 16, 2026 21:363,52350,706,87027,227,0002,016,0002,473,984
12Mar 16, 2026 21:363,52549,807,21126,232,0003,026,0002,519,040