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 06:47NoSIMD_C#NoSIMD_C#Score: 356,222Success
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 06:47351,814155,129,54688,116,00042,055,0002,342,912
2Nov 29, 2024 06:47356,222158,728,54287,868,00043,934,0002,347,008
3Nov 29, 2024 06:47356,497156,572,65782,940,00048,964,0002,330,624