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:38Steve BronderSteve BronderScore: 71,273Success
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:3871,18150,622,41926,337,00002,531,328
2Apr 21, 2025 04:3871,27348,626,33926,371,00002,269,184
3Apr 21, 2025 04:3871,78146,004,00626,559,00002,510,848