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 26, 2024 08:19NoSIMD_C#NoSIMD_C#Score: 278,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 08:19278,459133,731,02534,010,00069,020,0002,293,760
2Nov 26, 2024 08:19278,711132,655,932100,120,0003,003,0002,404,352
3Nov 26, 2024 08:19280,941140,964,38573,963,00029,985,0002,404,352