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 9, 2025 11:56NoSIMD_C#NoSIMD_C#Score: 509,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 11:56504,965217,008,692144,874,00041,963,0002,539,520
2Apr 9, 2025 11:56509,462219,261,574140,373,00048,128,0002,535,424
3Apr 9, 2025 11:56509,795216,627,683138,458,00050,166,0002,293,760