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 listMay 16, 2026 17:47M-RochatM-RochatScore: 67,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 17:4867,29733,866,35623,867,0001,033,0002,113,536
2May 16, 2026 17:4867,29733,704,99823,860,0001,040,0002,113,536
3May 16, 2026 17:4867,48338,560,10223,952,0001,017,0002,113,536
4May 16, 2026 17:4867,48633,579,28923,938,0001,032,0002,113,536
5May 16, 2026 17:4867,53234,143,73223,977,0001,010,0002,113,536
6May 16, 2026 17:4867,86736,812,68624,070,0001,041,0002,113,536
7May 16, 2026 17:4867,98636,779,84224,113,0001,042,0002,113,536
8May 16, 2026 17:4868,04036,829,53824,163,0001,012,0002,113,536
9May 16, 2026 17:4868,10534,362,72324,165,0001,034,0002,113,536