Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJul 13, 2023 14:57Paul MasurelPaul MasurelScore: 6,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 14:575,64769,636,23240,263,0006,039,0002,277,376
2Jul 13, 2023 14:575,86975,137,54641,107,0007,018,0002,285,568
3Jul 13, 2023 14:575,96476,246,29144,914,0003,992,0002,437,120
4Jul 13, 2023 14:575,97579,998,23943,994,0004,999,0002,502,656
5Jul 13, 2023 14:575,97876,980,68141,014,0008,002,0002,314,240
6Jul 13, 2023 14:576,159117,474,74250,507,56602,199,552
7Jul 13, 2023 14:576,273120,406,84151,441,89302,289,664
8Jul 13, 2023 14:5720,624194,193,981163,113,0006,004,0002,535,424
9Jul 13, 2023 14:5720,644197,638,436164,269,0005,008,0002,449,408
10Jul 13, 2023 14:5720,687198,375,725162,649,0006,984,0002,461,696
11Jul 13, 2023 14:5720,820243,271,996170,721,18202,269,184
12Jul 13, 2023 14:5720,826201,918,587163,784,0006,990,0002,363,392