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 28, 2024 08:31NoSIMD_C#NoSIMD_C#Score: 354,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 08:31352,881156,371,12187,379,00043,187,0002,535,424
2Nov 28, 2024 08:31354,030155,695,17387,994,00042,997,0002,531,328
3Nov 28, 2024 08:31356,222168,484,46981,877,00049,925,0002,527,232