TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listNov 23, 2024 06:20NoSIMD_C#NoSIMD_C#Score: 318,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 06:20317,211148,045,76773,230,00044,138,0002,547,712
2Nov 23, 2024 06:20317,695144,141,11761,285,00056,262,0002,547,712
3Nov 23, 2024 06:20317,865144,936,60169,360,00048,250,0002,396,160
4Nov 23, 2024 06:20318,357146,767,78770,875,00046,917,0002,293,760
5Nov 23, 2024 06:20318,430147,639,49370,891,00046,928,0002,301,952
6Nov 23, 2024 06:20318,792144,376,90270,972,00046,981,0002,547,712
7Nov 23, 2024 06:20318,803143,612,47172,974,00044,983,0002,297,856
8Nov 23, 2024 06:20319,389146,383,52473,108,00045,066,0002,293,760
9Nov 23, 2024 06:20319,649142,987,53370,160,00048,110,0002,416,640