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 12, 2026 04:52olliecrowolliecrowScore: 63,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 04:5260,36544,358,58522,335,00002,273,280
2Mar 12, 2026 04:5263,97048,632,16522,683,000986,0002,273,280
3Mar 12, 2026 04:5264,74349,210,13522,957,000998,0002,396,160