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 18, 2026 18:17M-RochatM-RochatScore: 59,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:1959,43733,396,28720,921,0001,071,0002,113,536
2May 18, 2026 18:1959,45934,313,53220,912,0001,088,0002,113,536
3May 18, 2026 18:1959,58933,541,54920,896,0001,152,0002,113,536
4May 18, 2026 18:1959,59431,466,46720,915,0001,135,0002,113,536
5May 18, 2026 18:1959,67232,063,25921,000,0001,079,0002,113,536
6May 18, 2026 18:1959,68931,427,11521,017,0001,068,0002,113,536
7May 18, 2026 18:1959,87032,865,84221,142,0001,010,0002,113,536
8May 18, 2026 18:1960,80534,531,57521,336,0001,162,0002,113,536
9May 18, 2026 18:1961,16445,930,14521,498,0001,133,0002,113,536