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 01:32Victor MerckléVictor MerckléScore: 64,437Success
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 01:3364,04534,238,04622,688,0001,009,0002,113,536
2May 12, 2026 01:3364,16734,288,11522,700,0001,042,0002,113,536
3May 12, 2026 01:3364,27234,146,01922,687,0001,094,0002,113,536
4May 12, 2026 01:3364,32132,507,60322,781,0001,018,0002,113,536
5May 12, 2026 01:3364,43733,447,99022,752,0001,090,0002,113,536
6May 12, 2026 01:3364,59735,245,78522,885,0001,016,0002,113,536
7May 12, 2026 01:3364,71832,794,60322,943,0001,003,0002,113,536
8May 12, 2026 01:3364,82434,961,45122,893,0001,092,0002,113,536
9May 12, 2026 01:3366,81837,146,23423,654,0001,069,0002,113,536