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 23, 2025 08:46NoSIMD_C#NoSIMD_C#Score: 168,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 08:46167,15988,219,42559,854,0001,995,0002,301,952
2Apr 23, 2025 08:46168,67087,776,80359,389,0003,019,0002,539,520
3Apr 23, 2025 08:46170,77389,287,03360,178,0003,008,0002,301,952