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 28, 2024 18:52Matthew SillsMatthew SillsScore: 76,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 18:5275,89755,463,64026,077,0002,005,0002,289,664
2Jul 28, 2024 18:5275,94349,896,16626,092,0002,007,0002,523,136
3Jul 28, 2024 18:5276,04150,078,11126,126,0002,009,0002,289,664
4Jul 28, 2024 18:5276,12251,922,34727,160,0001,005,0002,277,376
5Jul 28, 2024 18:5276,14155,563,75526,160,0002,012,0002,289,664
6Jul 28, 2024 18:5276,21151,116,93626,184,0002,014,0002,281,472
7Jul 28, 2024 18:5276,40051,026,41426,249,0002,019,0002,523,136
8Jul 28, 2024 18:5276,55752,783,61126,303,0002,023,0002,379,776
9Jul 28, 2024 18:5276,57653,014,56226,310,0002,023,0002,289,664
10Jul 28, 2024 18:5279,53196,510,15429,426,60502,269,184
11Jul 28, 2024 18:5279,98097,530,69529,592,76202,269,184
12Jul 28, 2024 18:5280,43592,804,36529,760,92202,265,088