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 20:37Victor MerckléVictor MerckléScore: 64,648Success
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 20:3864,45134,472,04322,833,0001,014,0002,113,536
2May 11, 2026 20:3864,49133,089,85222,841,0001,021,0002,113,536
3May 11, 2026 20:3864,54832,981,12322,877,0001,006,0002,113,536
4May 11, 2026 20:3864,58333,404,19022,870,0001,026,0002,113,536
5May 11, 2026 20:3864,64833,416,26222,893,0001,027,0002,113,536
6May 11, 2026 20:3864,75433,656,68722,874,0001,085,0002,113,536
7May 11, 2026 20:3864,95633,746,49823,012,0001,022,0002,113,536
8May 11, 2026 20:3864,98932,770,66223,025,0001,021,0002,113,536
9May 11, 2026 20:3865,25932,944,43023,034,0001,112,0002,113,536