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:59NoSIMD_C#NoSIMD_C#Score: 167,984Success
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:59167,11992,060,14458,842,0002,992,0002,543,616
2Apr 23, 2025 08:59167,30886,111,70859,908,0001,996,0002,519,040
3Apr 23, 2025 08:59167,46893,211,73659,965,0001,998,0002,519,040
4Apr 23, 2025 08:59167,51985,772,25659,983,0001,999,0002,523,136
5Apr 23, 2025 08:59167,98488,009,93961,152,0001,002,0002,535,424
6Apr 23, 2025 08:59168,13890,238,96260,205,0002,006,0002,289,664
7Apr 23, 2025 08:59168,22286,996,06860,235,0002,007,0002,301,952
8Apr 23, 2025 08:59168,24693,435,34860,243,0002,008,0002,301,952
9Apr 23, 2025 08:59169,00092,212,18460,513,0002,017,0002,535,424