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:51NoSIMD_C#NoSIMD_C#Score: 206,603Success
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:51206,597102,944,68374,430,0002,011,0002,289,664
2Apr 23, 2025 08:51206,603109,561,24874,432,0002,011,0002,551,808
3Apr 23, 2025 08:51207,654103,964,09973,839,0002,993,0002,535,424