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 listJun 15, 2025 11:25Steve BronderSteve BronderScore: 70,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2025 11:2570,28448,985,77424,005,0002,000,0002,424,832
2Jun 15, 2025 11:2570,58448,460,20425,112,0001,004,0002,535,424
3Jun 15, 2025 11:2570,63847,650,92424,126,0002,010,0002,539,520