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 listMay 19, 2025 05:29KeefeKeefeScore: 2,033,014Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 05:291,960,781751,907,858586,587,000138,902,0002,433,024
2May 19, 2025 05:292,033,014780,300,532617,356,000134,859,0002,342,912
3May 19, 2025 05:292,085,389797,017,715638,664,000132,930,0002,363,392