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:27NoSIMD_C#NoSIMD_C#Score: 578,054Success
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:27577,784241,740,937165,830,00047,950,0002,535,424
2Apr 9, 2025 16:27578,054237,612,912174,902,00038,978,0002,318,336
3Apr 9, 2025 16:27579,638239,276,644182,397,00032,069,0002,469,888