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 11, 2025 07:15Valentin KofmanValentin KofmanScore: 4,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 07:154,52357,931,27233,077,0004,009,0002,502,656
2Jul 11, 2025 07:154,55763,300,80329,288,0008,079,0002,293,760
3Jul 11, 2025 07:154,59470,038,02431,562,0006,108,0002,281,472
4Jul 11, 2025 07:154,61462,271,56431,862,0005,974,0002,301,952
5Jul 11, 2025 07:154,66063,105,47233,182,0005,027,0002,494,464
6Jul 11, 2025 07:154,86169,219,34934,877,0004,982,0002,273,280
7Jul 11, 2025 07:154,87168,092,48125,961,00013,979,0002,486,272
8Jul 11, 2025 07:154,87663,383,09325,988,00013,993,0002,347,008
9Jul 11, 2025 07:154,91067,688,73232,213,0008,053,0002,269,184