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 7, 2026 19:50pseppsepScore: 41,025Success
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:4940,931365,414,911336,734,0002,997,0002,510,848
2Dec 13, 2025 11:4941,006364,131,164338,345,0002,002,0002,375,680
3Dec 13, 2025 11:4941,008361,142,158339,366,0001,001,0002,256,896
4Dec 13, 2025 11:4941,020372,392,889337,466,0003,004,0002,519,040
5Dec 13, 2025 11:4941,021366,925,007339,474,0001,001,0002,510,848
6Dec 13, 2025 11:4941,025370,772,761339,508,0001,001,0002,519,040
7Mar 7, 2026 19:5041,025371,851,736339,508,0001,001,0002,506,752
8Mar 7, 2026 19:5041,028367,905,015338,532,0001,997,0002,514,944
9Dec 13, 2025 11:4941,042369,266,777339,649,000998,0002,510,848
10Dec 13, 2025 11:4941,044366,537,089338,667,0001,998,0002,510,848
11Mar 7, 2026 19:5041,044366,073,493338,665,0001,998,0002,514,944
12Dec 13, 2025 11:4941,791376,853,932344,864,0001,999,0002,256,896