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 21, 2026 18:50M-RochatM-RochatScore: 59,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:5159,32432,887,44820,876,0001,074,0002,113,536
2May 21, 2026 18:5159,41833,388,03020,843,0001,142,0002,113,536
3May 21, 2026 18:5159,46732,940,89620,847,0001,156,0002,113,536
4May 21, 2026 18:5159,50831,617,05620,864,0001,154,0002,113,536
5May 21, 2026 18:5159,56733,436,58620,892,0001,148,0002,113,536
6May 21, 2026 18:5159,57232,197,65120,880,0001,162,0002,113,536
7May 21, 2026 18:5159,57833,390,41320,981,0001,063,0002,113,536
8May 21, 2026 18:5159,59733,357,89220,975,0001,076,0002,113,536
9May 21, 2026 18:5159,78633,097,26120,949,0001,172,0002,113,536