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 listJun 29, 2026 13:23IlyaIlyaScore: 63,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 13:2763,54032,997,22322,414,0001,096,0002,113,536
2Jun 29, 2026 13:2763,86233,104,43722,441,0001,188,0002,113,536
3Jun 29, 2026 13:2763,86433,130,95722,435,0001,195,0002,113,536
4Jun 29, 2026 13:2763,90533,127,03522,550,0001,095,0002,113,536
5Jun 29, 2026 13:2763,92733,538,29622,435,0001,218,0002,113,536
6Jun 29, 2026 13:2764,04833,206,60822,506,0001,192,0002,113,536
7Jun 29, 2026 13:2764,10233,688,40722,512,0001,206,0002,113,536
8Jun 29, 2026 13:2764,11333,271,63522,581,0001,141,0002,113,536
9Jun 29, 2026 13:2764,24833,295,39622,586,0001,186,0002,113,536