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 22, 2025 09:53NoSIMD_C#NoSIMD_C#Score: 167,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 09:53167,04389,249,31358,816,0002,990,0002,539,520
2Apr 22, 2025 09:53167,71989,725,12260,055,0002,001,0002,543,616
3Apr 22, 2025 09:53168,51191,462,66860,338,0002,011,0002,289,664