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 02:12M-RochatM-RochatScore: 60,732Success
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 02:1360,41632,915,47321,202,0001,152,0002,113,536
2May 18, 2026 02:1360,44532,080,96821,220,0001,145,0002,113,536
3May 18, 2026 02:1360,54033,894,74221,230,0001,170,0002,113,536
4May 18, 2026 02:1360,65133,383,32921,275,0001,166,0002,113,536
5May 18, 2026 02:1360,73234,851,54321,315,0001,156,0002,113,536
6May 18, 2026 02:1360,75934,384,68221,309,0001,172,0002,113,536
7May 18, 2026 02:1360,86432,475,05921,506,0001,014,0002,113,536
8May 18, 2026 02:1360,88933,371,81321,514,0001,015,0002,113,536
9May 18, 2026 02:1361,02432,447,83321,404,0001,175,0002,113,536