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 4, 2026 04:16olliecrowolliecrowScore: 69,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 04:1669,75152,206,83323,823,0001,985,0002,277,376
2Mar 4, 2026 04:1669,90354,873,36624,870,000994,0002,277,376
3Mar 4, 2026 04:1670,01951,126,62924,911,000996,0002,514,944