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 22:15Valentin KofmanValentin KofmanScore: 63,576Success
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 21:2763,23043,352,54922,378,0001,017,0002,510,848
2Jul 15, 2025 21:2763,30544,380,63722,405,0001,018,0002,269,184
3Jul 15, 2025 21:2763,41153,575,40922,442,0001,020,0002,400,256
4Jul 15, 2025 21:2763,44347,354,21923,474,00002,396,160
5Jul 15, 2025 21:2763,44945,821,08722,456,0001,020,0002,269,184
6Jul 15, 2025 22:1563,48443,801,34423,489,00002,392,064
7Jul 15, 2025 22:1563,57645,690,13322,501,0001,022,0002,510,848
8Jul 15, 2025 21:2763,59739,475,35122,508,0001,023,0002,400,256
9Jul 15, 2025 21:2763,61148,555,19822,513,0001,023,0002,269,184
10Jul 15, 2025 21:2763,62251,307,39722,517,0001,023,0002,269,184
11Jul 15, 2025 21:2763,65750,778,25123,553,00002,387,968
12Jul 15, 2025 22:1563,78149,314,24523,599,00002,269,184