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 04:56Steve BronderSteve BronderScore: 72,689Success
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 04:5672,09755,458,31426,676,00002,433,024
2Apr 21, 2025 04:5672,68959,406,59424,903,0001,992,0002,433,024
3Apr 21, 2025 04:5672,98947,249,77726,006,0001,000,0002,428,928