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 listNov 6, 2024 10:04Alexander KosachevAlexander KosachevScore: 1,334,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 10:041,275,52910,617,561,55010,504,929,00081,960,0002,514,944
2Nov 6, 2024 10:041,331,93011,089,230,27310,983,049,00071,967,0002,293,760
3Nov 6, 2024 10:041,332,06611,084,139,04710,987,176,00068,969,0002,281,472
4Nov 6, 2024 10:041,333,67611,098,172,36710,994,549,00074,962,0002,281,472
5Nov 6, 2024 10:041,334,53011,107,143,28011,019,624,00056,972,0002,281,472
6Nov 6, 2024 10:041,334,64211,103,749,96511,007,555,00069,971,0002,293,760
7Nov 6, 2024 10:041,335,16611,114,150,93310,999,909,00081,969,0002,281,472
8Nov 6, 2024 10:041,338,60011,142,707,47711,029,422,00080,959,0002,281,472
9Nov 6, 2024 10:041,339,05511,148,328,21111,053,186,00060,967,0002,281,472