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 00:37Victor MerckléVictor MerckléScore: 64,729Success
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 00:3864,48934,761,85722,854,0001,007,0002,113,536
2May 12, 2026 00:3864,55434,699,72122,806,0001,079,0002,113,536
3May 12, 2026 00:3864,55634,730,32422,791,0001,095,0002,113,536
4May 12, 2026 00:3864,56434,766,43722,799,0001,090,0002,113,536
5May 12, 2026 00:3864,72935,577,65722,871,0001,079,0002,113,536
6May 12, 2026 00:3864,74334,159,67922,850,0001,105,0002,113,536
7May 12, 2026 00:3865,11032,853,54023,001,0001,090,0002,113,536
8May 12, 2026 00:3865,18633,907,53423,012,0001,107,0002,113,536
9May 12, 2026 00:3865,20832,803,21823,028,0001,099,0002,113,536