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 20, 2025 11:24idatsyidatsyScore: 50,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 11:2649,972441,606,952413,767,000999,0002,289,664
2Dec 20, 2025 11:2449,989444,506,919412,908,0001,999,0002,367,488
3Dec 20, 2025 11:2650,268440,086,095416,224,0001,000,0002,359,296
4Dec 20, 2025 11:2650,289448,596,557417,400,00002,289,664
5Dec 20, 2025 11:2450,292443,847,821416,424,0001,001,0002,289,664
6Dec 20, 2025 11:2450,307443,069,969417,551,00002,363,392
7Dec 20, 2025 11:2450,321445,655,573415,670,0001,998,0002,363,392
8Dec 20, 2025 11:2450,321448,585,589416,665,000999,0002,367,488
9Dec 20, 2025 11:2450,448449,038,308416,724,0001,998,0002,363,392