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 09:06Valentin KofmanValentin KofmanScore: 3,380,224Success
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 09:063,363,7621,269,723,7901,242,593,0001,999,0002,289,664
2Jul 15, 2025 09:063,368,2841,273,749,9681,244,267,0001,998,0002,289,664
3Jul 15, 2025 09:063,376,6491,278,464,5141,247,362,0001,998,0002,387,968
4Jul 15, 2025 09:063,377,0761,280,206,1921,247,519,0001,999,0002,285,568
5Jul 15, 2025 09:063,380,2241,273,484,8041,250,683,00002,281,472
6Jul 15, 2025 09:063,384,5591,282,093,8841,250,289,0001,998,0002,289,664
7Jul 15, 2025 09:063,385,8621,281,716,3561,252,769,00002,289,664
8Jul 15, 2025 09:063,386,6351,283,854,8321,252,055,0001,000,0002,289,664
9Jul 15, 2025 09:063,389,1411,280,745,5291,253,982,00002,289,664