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 16:47NoSIMD_C#NoSIMD_C#Score: 573,973Success
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 16:47573,705238,553,734167,214,00045,057,0002,293,760
2Apr 9, 2025 16:47573,973233,327,250171,299,00041,071,0002,486,272
3Apr 9, 2025 16:47574,135241,082,276164,333,00048,097,0002,293,760