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 listApr 22, 2026 13:01BenBenScore: 73,162Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 13:0272,80246,005,41524,942,0001,995,0002,457,600
2Apr 22, 2026 13:0272,85644,478,50223,962,0002,995,0002,449,408
3Apr 22, 2026 13:0272,87046,998,73923,967,0002,995,0002,453,504
4Apr 22, 2026 13:0273,08340,463,79024,037,0003,004,0002,457,600
5Apr 22, 2026 13:0273,16245,313,77824,063,0003,007,0002,478,080
6Apr 22, 2026 13:0273,28645,106,21826,112,0001,004,0002,465,792
7Apr 22, 2026 13:0273,34545,075,08125,128,0002,010,0002,461,696
8Apr 22, 2026 13:0273,42740,745,69525,156,0002,012,0002,461,696
9Apr 22, 2026 13:0273,65947,412,74724,226,0003,028,0002,461,696