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 listMar 3, 2026 13:20NoSIMD_C#NoSIMD_C#Score: 174,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 13:20173,37390,136,63962,144,0002,004,0002,416,640
2Mar 3, 2026 13:20174,32285,903,27363,492,0001,007,0002,437,120
3Mar 3, 2026 13:20174,44189,313,53364,543,00002,428,928