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 23, 2025 15:00Josu San MartinJosu San MartinScore: 34,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 15:0034,262309,901,099284,374,00002,265,088
2Dec 23, 2025 15:0034,293311,021,534281,634,0002,996,0002,265,088
3Dec 23, 2025 15:0034,298314,037,448282,680,0001,997,0002,289,664
4Dec 23, 2025 15:0034,300314,166,471282,690,0001,997,0002,289,664
5Dec 23, 2025 15:0034,301310,471,948282,703,0001,997,0002,289,664
6Dec 23, 2025 15:0034,303312,347,191283,716,000999,0002,375,680
7Dec 23, 2025 15:0034,309312,141,894282,766,0001,998,0002,289,664
8Dec 23, 2025 15:0034,309309,988,454282,769,0001,998,0002,527,232
9Dec 23, 2025 15:0034,313313,067,034282,803,0001,998,0002,289,664