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 11, 2026 22:04Victor MerckléVictor MerckléScore: 64,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 22:0564,42933,663,37422,835,0001,004,0002,113,536
2May 11, 2026 22:0564,63533,527,29522,817,0001,098,0002,113,536
3May 11, 2026 22:0564,66733,788,86122,816,0001,111,0002,113,536
4May 11, 2026 22:0564,69433,425,20222,847,0001,090,0002,113,536
5May 11, 2026 22:0564,85434,774,91822,977,0001,019,0002,113,536
6May 11, 2026 22:0564,89432,737,85522,870,0001,141,0002,113,536
7May 11, 2026 22:0564,95135,708,07422,958,0001,074,0002,113,536
8May 11, 2026 22:0565,09434,586,56222,985,0001,100,0002,113,536
9May 11, 2026 22:0565,11032,830,86422,997,0001,094,0002,113,536