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:09Victor MerckléVictor MerckléScore: 64,662Success
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:1064,54832,577,92222,796,0001,087,0002,113,536
2May 12, 2026 00:1064,60233,577,33122,807,0001,096,0002,113,536
3May 12, 2026 00:1064,60534,626,38422,816,0001,088,0002,113,536
4May 12, 2026 00:1064,65634,203,85722,848,0001,075,0002,113,536
5May 12, 2026 00:1064,66234,668,44722,842,0001,083,0002,113,536
6May 12, 2026 00:1064,73532,936,60722,872,0001,080,0002,113,536
7May 12, 2026 00:1064,93732,675,62923,023,0001,004,0002,113,536
8May 12, 2026 00:1065,07232,865,03922,985,0001,092,0002,113,536
9May 12, 2026 00:1065,17833,149,02323,001,0001,115,0002,113,536