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 04:55NoSIMD_C#NoSIMD_C#Score: 286,449Success
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 04:55286,097134,411,14363,913,00041,943,0002,535,424
2Nov 29, 2024 04:55286,449138,227,72860,992,00044,994,0002,326,528
3Nov 29, 2024 04:55288,657134,731,89960,888,00045,915,0002,330,624