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 listDec 5, 2024 07:06NoSIMD_C#NoSIMD_C#Score: 277,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2024 07:06276,970128,796,06362,291,00040,188,0002,535,424
2Dec 5, 2024 07:06277,400139,089,19655,344,00047,294,0002,535,424
3Dec 5, 2024 07:06278,246127,087,94152,975,00049,976,0002,379,776