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 21, 2025 05:13Steve BronderSteve BronderScore: 71,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 05:1371,47051,226,61025,427,0001,017,0002,531,328
2Apr 21, 2025 05:1371,51449,091,16626,460,00002,531,328
3Apr 21, 2025 05:1371,62252,559,65625,481,0001,019,0002,269,184