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 16, 2023 14:34Paul MasurelPaul MasurelScore: 71,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 14:3470,50052,158,52624,079,0002,006,0002,281,472
2Jul 16, 2023 14:3470,72450,006,24025,162,0001,006,0002,281,472
3Jul 16, 2023 14:3470,72453,263,00725,162,0001,006,0002,363,392
4Jul 16, 2023 14:3470,79749,245,82324,180,0002,015,0002,367,488
5Jul 16, 2023 14:3470,92752,768,58624,225,0002,018,0002,351,104
6Jul 16, 2023 14:3471,17651,527,11825,323,0001,012,0002,281,472
7Jul 16, 2023 14:3471,74645,296,20725,525,0001,021,0002,281,472
8Jul 16, 2023 14:3471,75448,166,28326,549,00002,342,912
9Jul 16, 2023 14:3472,06255,809,87225,638,0001,025,0002,277,376
10Jul 16, 2023 14:3474,36899,491,24027,516,19102,195,456
11Jul 16, 2023 14:3475,14489,962,51727,803,42402,203,648
12Jul 16, 2023 14:3476,119103,534,92528,164,18402,191,360