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 27, 2025 13:59AkashAkashScore: 2,066,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 13:592,063,25417,156,103,49817,063,041,00061,971,0002,293,760
2Dec 27, 2025 13:592,064,71117,166,136,48817,072,125,00064,973,0002,281,472
3Dec 27, 2025 13:592,065,04717,175,265,13217,071,924,00067,967,0002,375,680
4Dec 27, 2025 13:592,065,91317,180,250,87817,088,105,00058,976,0002,281,472
5Dec 27, 2025 13:592,066,75317,183,895,83717,090,074,00063,974,0002,281,472
6Dec 27, 2025 13:592,068,91117,207,022,42017,100,997,00070,966,0002,281,472
7Dec 27, 2025 13:592,069,39417,206,011,71117,109,000,00066,972,0002,281,472
8Dec 27, 2025 13:592,089,93317,379,904,05117,274,480,00071,968,0002,281,472
9Dec 27, 2025 13:592,244,10118,657,996,84618,567,070,00058,971,0002,281,472