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 18:00NoSIMD_C#NoSIMD_C#Score: 271,511Success
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 18:00270,924124,262,72654,131,00046,111,0002,293,760
2Apr 9, 2025 18:00271,511124,825,67063,289,00037,170,0002,293,760
3Apr 9, 2025 18:00273,957130,602,79555,750,00045,614,0002,539,520