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 04:18NoSIMD_C#NoSIMD_C#Score: 279,470Success
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 04:18278,435137,345,39653,011,00050,010,0002,301,952
2Apr 6, 2025 04:18279,470133,449,28467,263,00036,141,0002,535,424
3Apr 6, 2025 04:18281,349132,840,50061,058,00043,041,0002,527,232