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 16, 2026 20:53M-RochatM-RochatScore: 67,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 20:5467,35936,391,26723,880,0001,043,0002,113,536
2May 16, 2026 20:5467,62433,846,77124,006,0001,015,0002,113,536
3May 16, 2026 20:5467,69133,862,35824,019,0001,027,0002,113,536
4May 16, 2026 20:5467,82134,400,50024,067,0001,027,0002,113,536
5May 16, 2026 20:5467,87834,860,94224,089,0001,026,0002,113,536
6May 16, 2026 20:5467,90036,641,91324,097,0001,026,0002,113,536
7May 16, 2026 20:5467,96733,904,07124,127,0001,021,0002,113,536
8May 16, 2026 20:5468,00233,908,00024,128,0001,033,0002,113,536
9May 16, 2026 20:5468,14334,619,67024,194,0001,019,0002,113,536