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 listMar 17, 2025 23:25Aniruddha DebAniruddha DebScore: 71,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 23:2571,38148,107,18926,411,00002,531,328
2Mar 17, 2025 23:2571,49748,712,75426,454,00002,531,328
3Mar 17, 2025 23:2571,76248,547,69626,552,00002,269,184