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 9, 2026 20:01Daniel MastalerzDaniel MastalerzScore: 10,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 20:0110,368108,736,02683,051,0003,001,0002,404,352
2Feb 9, 2026 20:0110,371107,551,46581,078,0005,004,0002,396,160
3Feb 9, 2026 20:0110,375107,687,07982,106,0004,005,0002,318,336
4Feb 9, 2026 20:0110,376109,665,58681,117,0005,007,0002,330,624
5Feb 9, 2026 20:0110,382113,061,80181,159,0005,009,0002,297,856
6Feb 9, 2026 20:0110,393108,770,35483,255,0003,009,0002,318,336
7Feb 9, 2026 20:0110,408108,731,36581,367,0005,022,0002,330,624
8Feb 9, 2026 20:0110,423111,274,74482,484,0004,023,0002,318,336
9Feb 9, 2026 20:0110,428114,850,10583,533,0003,019,0002,293,760
10Feb 9, 2026 20:0110,514109,679,90186,263,0001,003,0002,314,240
11Feb 9, 2026 20:0110,517115,037,78283,276,0004,013,0002,412,544
12Feb 9, 2026 20:0110,544114,700,99882,486,0005,029,0002,400,256