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 6, 2026 01:30Victor MerckléVictor MerckléScore: 3,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 01:313,37136,729,64726,595,0001,050,0002,113,536
2Jun 6, 2026 01:313,39037,002,44626,743,0001,056,0002,113,536
3Jun 6, 2026 01:313,41337,126,24225,991,0002,002,0002,113,536
4Jun 6, 2026 01:313,41837,169,07826,016,0002,018,0002,113,536
5Jun 6, 2026 01:313,42337,223,38326,065,0002,004,0002,113,536
6Jun 6, 2026 01:313,43937,317,62826,196,0002,007,0002,113,536
7Jun 6, 2026 01:313,49437,913,04726,563,0002,095,0002,113,536
8Jun 6, 2026 01:3112,963115,431,914104,280,0002,018,0002,113,536
9Jun 6, 2026 01:3113,359118,638,304107,332,0002,214,0002,113,536