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 listJun 28, 2026 06:58Victor MerckléVictor MerckléScore: 12,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 06:593,04732,857,46223,873,0001,116,0002,113,536
2Jun 28, 2026 06:593,06932,961,68624,071,0001,101,0002,113,536
3Jun 28, 2026 06:593,07233,033,69024,041,0001,155,0002,113,536
4Jun 28, 2026 06:593,11333,705,38624,409,0001,125,0002,113,536
5Jun 28, 2026 06:5912,059106,752,93697,882,0001,007,0002,113,536
6Jun 28, 2026 06:5912,080106,924,40498,053,0001,009,0002,113,536
7Jun 28, 2026 06:5912,113107,811,46698,323,0001,008,0002,113,536
8Jun 28, 2026 06:5912,636111,502,259102,610,0001,007,0002,113,536
9Jun 28, 2026 06:5912,664111,758,696102,840,0001,007,0002,113,536