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 listDec 13, 2025 11:44pseppsepScore: 41,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2025 11:4441,869378,205,139344,512,0003,004,0002,510,848
2Dec 13, 2025 11:4441,885378,098,689346,647,000998,0002,519,040
3Dec 13, 2025 11:4441,942375,846,627347,116,0001,000,0002,514,944
4Dec 13, 2025 11:4441,943373,886,676346,127,0002,000,0002,379,776
5Dec 13, 2025 11:4441,954371,065,050346,217,0002,001,0002,502,656
6Dec 13, 2025 11:4441,956375,129,542347,236,0001,000,0002,519,040
7Dec 13, 2025 11:4441,966371,646,238346,318,0002,001,0002,375,680
8Dec 13, 2025 11:4441,980380,288,626346,435,0001,996,0002,510,848
9Dec 13, 2025 11:4442,022379,466,830346,782,0001,998,0002,379,776