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 15, 2025 12:13Aniruddha DebAniruddha DebScore: 70,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2025 12:1370,60548,190,89825,120,0001,004,0002,424,832
2Mar 15, 2025 12:1370,81150,239,28225,193,0001,007,0002,531,328
3Mar 15, 2025 12:1371,33052,297,69926,392,00002,531,328