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 09:02NoSIMD_C#NoSIMD_C#Score: 168,097Success
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 09:02167,21987,713,39258,878,0002,993,0002,543,616
2Apr 23, 2025 09:02168,09793,490,40261,193,0001,003,0002,547,712
3Apr 23, 2025 09:02168,75789,214,89359,419,0003,021,0002,367,488