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 listAug 2, 2025 20:32Jack FrigaardJack FrigaardScore: 4,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 20:324,88765,897,87338,537,0002,028,0002,519,040
2Aug 2, 2025 20:324,91869,940,61637,832,0002,986,0002,519,040
3Aug 2, 2025 20:324,91870,092,55937,833,0002,986,0002,519,040
4Aug 2, 2025 20:324,92171,914,19837,855,0002,988,0002,519,040
5Aug 2, 2025 20:324,92869,158,33139,902,000997,0002,514,944
6Aug 2, 2025 20:324,96069,246,33338,159,0003,012,0002,510,848