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:52Victor MerckléVictor MerckléScore: 3,227Success
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:533,20333,876,94625,223,0001,049,0002,117,632stderr
2Jun 23, 2026 13:533,21233,945,90225,280,0001,066,0002,117,632stderr
3Jun 23, 2026 13:533,21933,989,31625,335,0001,061,0002,117,632stderr
4Jun 23, 2026 13:533,22734,087,01125,400,0001,064,0002,117,632stderr
5Jun 23, 2026 13:533,22734,071,27425,399,0001,070,0002,117,632stderr
6Jun 23, 2026 13:533,24334,190,68325,521,0001,079,0002,117,632stderr
7Jun 23, 2026 13:533,25134,349,92525,588,0001,072,0002,117,632stderr
8Jun 23, 2026 13:533,33235,295,54125,220,0002,107,0002,117,632stderr
9Jun 23, 2026 13:5312,183107,503,04498,887,0001,015,0002,117,632stderr