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 27, 2026 18:57lipapipalipapipaScore: 28,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 18:5728,830258,226,890239,291,00002,514,944
2Feb 27, 2026 18:5728,852267,675,401237,470,0002,003,0002,433,024
3Feb 27, 2026 18:5728,892266,653,906236,809,0002,997,0002,412,544
4Feb 27, 2026 18:5728,908263,739,873237,936,0001,999,0002,269,184
5Feb 27, 2026 18:5728,952266,138,666238,296,0002,002,0002,502,656
6Feb 27, 2026 18:5729,001271,609,960237,714,0002,996,0002,433,024
7Feb 27, 2026 18:5729,211268,277,303242,455,00002,289,664
8Feb 27, 2026 18:5729,250268,641,202240,779,0001,998,0002,424,832
9Feb 27, 2026 18:5729,295265,594,969240,148,0003,001,0002,424,832