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 listJul 15, 2025 18:06Valentin KofmanValentin KofmanScore: 63,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 18:0663,30844,191,02723,424,00002,383,872
2Jul 15, 2025 18:0663,37044,506,89822,428,0001,019,0002,269,184
3Jul 15, 2025 18:0663,42446,101,25323,467,00002,269,184
4Jul 15, 2025 18:0663,52448,614,85522,483,0001,021,0002,400,256
5Jul 15, 2025 18:0663,53843,306,60422,487,0001,022,0002,392,064
6Jul 15, 2025 18:0663,66845,823,37121,509,0002,048,0002,392,064
7Jul 15, 2025 18:0663,70549,174,65322,547,0001,024,0002,269,184
8Jul 15, 2025 18:0663,79246,204,74922,577,0001,026,0002,392,064
9Jul 15, 2025 18:0663,82753,498,56922,590,0001,026,0002,269,184