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 listJul 15, 2025 17:53Valentin KofmanValentin KofmanScore: 69,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 17:5368,54951,200,31223,334,0002,029,0002,269,184
2Jul 15, 2025 17:5368,73558,284,18924,415,0001,017,0002,281,472
3Jul 15, 2025 17:5368,74650,816,63024,419,0001,017,0002,281,472
4Jul 15, 2025 17:5368,78450,157,94324,432,0001,018,0002,371,584
5Jul 15, 2025 17:5369,06255,414,57925,553,00002,281,472
6Jul 15, 2025 17:5369,12253,290,60024,552,0001,023,0002,265,088
7Jul 15, 2025 17:5369,27056,402,86524,605,0001,025,0002,269,184
8Jul 15, 2025 17:5369,27355,624,50824,606,0001,025,0002,281,472
9Jul 15, 2025 17:5369,30053,881,40524,616,0001,025,0002,281,472