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 listOct 16, 2024 00:09zielajzielajScore: 4,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 00:094,58562,825,08233,531,0004,064,0002,363,392
2Oct 16, 2024 00:094,59563,667,26331,572,0006,110,0002,506,752
3Oct 16, 2024 00:094,61768,293,32230,885,0006,974,0002,428,928
4Oct 16, 2024 00:094,65362,446,69029,121,0009,037,0002,375,680
5Oct 16, 2024 00:094,66159,549,11431,182,0007,041,0002,355,200
6Oct 16, 2024 00:094,68763,146,92730,345,0008,092,0002,510,848
7Oct 16, 2024 00:094,69165,858,38632,392,0006,073,0002,457,600
8Oct 16, 2024 00:094,69460,225,77731,399,0007,090,0002,486,272
9Oct 16, 2024 00:094,70566,924,01832,489,0006,091,0002,535,424