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 listAug 16, 2026 23:13Tomislav TunkovicTomislav TunkovicScore: 58,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:1857,95131,298,44220,416,0001,026,00024,576
2Aug 17, 2026 05:1857,97831,474,47920,415,0001,037,00024,576
3Aug 17, 2026 05:1858,03732,051,10220,451,0001,023,00024,576
4Aug 17, 2026 05:1858,10532,112,09020,473,0001,026,00024,576
5Aug 17, 2026 05:1858,11831,351,59820,470,0001,034,00024,576
6Aug 17, 2026 05:1858,17232,179,77920,495,0001,029,00024,576
7Aug 17, 2026 05:1858,25432,162,32720,512,0001,042,00024,576
8Aug 17, 2026 05:1858,30532,233,62220,518,0001,055,00024,576
9Aug 17, 2026 05:1858,50231,848,40120,530,0001,116,00024,576