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 29, 2024 08:09NoSIMD_C#NoSIMD_C#Score: 279,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 08:09276,719127,408,43462,235,00040,151,0002,408,448
2Nov 29, 2024 08:09278,214126,996,5780102,939,0002,535,424
3Nov 29, 2024 08:09278,430131,932,80851,009,00052,010,0002,293,760
4Nov 29, 2024 08:09278,541131,534,89419,011,00084,049,0002,527,232
5Nov 29, 2024 08:09279,024133,746,68964,149,00039,090,0002,535,424
6Nov 29, 2024 08:09279,546122,987,53459,248,00044,184,0002,392,064
7Nov 29, 2024 08:09279,632130,008,05449,221,00054,243,0002,531,328
8Nov 29, 2024 08:09279,908129,612,05442,231,00061,335,0002,478,080
9Nov 29, 2024 08:09281,541134,500,10249,080,00055,090,0002,387,968