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 23, 2026 13:47Victor MerckléVictor MerckléScore: 3,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 13:483,20733,763,22525,250,0001,054,0002,113,536
2Jun 23, 2026 13:483,20933,732,65225,251,0001,066,0002,113,536
3Jun 23, 2026 13:483,20933,942,45225,245,0001,069,0002,113,536
4Jun 23, 2026 13:483,21433,795,32625,294,0001,066,0002,113,536
5Jun 23, 2026 13:483,21933,818,38625,329,0001,067,0002,113,536
6Jun 23, 2026 13:483,27834,508,17325,844,0001,036,0002,113,536
7Jun 23, 2026 13:483,27834,290,96225,809,0001,076,0002,113,536
8Jun 23, 2026 13:483,34235,033,89725,328,0002,084,0002,113,536
9Jun 23, 2026 13:4812,672111,543,248102,905,0001,013,0002,113,536