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 12, 2026 01:26Victor MerckléVictor MerckléScore: 64,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:2764,14333,106,73722,647,0001,086,0002,113,536
2May 12, 2026 01:2764,14532,569,41522,715,0001,019,0002,113,536
3May 12, 2026 01:2764,24534,614,05522,667,0001,104,0002,113,536
4May 12, 2026 01:2764,28932,687,38622,706,0001,081,0002,113,536
5May 12, 2026 01:2764,37034,117,67722,723,0001,094,0002,113,536
6May 12, 2026 01:2764,49133,402,84322,856,0001,006,0002,113,536
7May 12, 2026 01:2764,55433,064,89822,814,0001,071,0002,113,536
8May 12, 2026 01:2764,64532,704,00322,837,0001,082,0002,113,536
9May 12, 2026 01:2764,95134,748,77122,904,0001,128,0002,113,536