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 listApr 6, 2025 03:56NoSIMD_C#NoSIMD_C#Score: 282,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2025 03:56280,486135,141,60351,890,00051,890,0002,527,232
2Apr 6, 2025 03:56282,068131,276,79570,246,00034,119,0002,297,856
3Apr 6, 2025 03:56283,324131,353,14653,913,00050,917,0002,535,424