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 22, 2025 06:16Ruoyu QiuRuoyu QiuScore: 60,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 06:0960,884531,265,914504,334,0001,000,0002,265,088
2Aug 22, 2025 06:0960,891532,781,551503,392,0002,001,0002,273,280
3Aug 22, 2025 06:1560,896531,409,124504,435,0001,000,0002,273,280
4Aug 22, 2025 06:1560,903532,461,167502,497,0002,997,0002,273,280
5Aug 22, 2025 06:0960,914535,643,717504,586,000999,0002,535,424
6Aug 22, 2025 06:1560,933535,405,994502,744,0002,998,0002,273,280
7Aug 22, 2025 06:1661,881539,967,474510,613,0002,997,0002,260,992
8Aug 22, 2025 06:1661,915538,475,959511,897,0001,999,0002,273,280
9Aug 22, 2025 06:1661,987542,736,641511,498,0002,997,0002,273,280