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 16:42Victor MerckléVictor MerckléScore: 72,016Success
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 16:4371,68337,755,86625,467,0001,056,0002,113,536
2May 11, 2026 16:4371,77837,242,44025,522,0001,036,0002,113,536
3May 11, 2026 16:4371,92937,330,07825,499,0001,115,0002,113,536
4May 11, 2026 16:4372,00235,406,37525,509,0001,132,0002,113,536
5May 11, 2026 16:4372,01639,730,02725,634,0001,012,0002,113,536
6May 11, 2026 16:4372,13737,061,14025,626,0001,065,0002,113,536
7May 11, 2026 16:4372,22136,162,21725,668,0001,054,0002,113,536
8May 11, 2026 16:4372,27037,386,19325,608,0001,132,0002,113,536
9May 11, 2026 16:4372,43235,799,40425,648,0001,152,0002,113,536