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 listJan 29, 2026 20:43lipapipalipapipaScore: 30,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 20:4330,603277,565,434248,942,0001,999,0002,273,280
2Jan 29, 2026 20:4330,621278,806,676249,089,0002,000,0002,281,472
3Jan 29, 2026 20:4331,217281,522,026254,982,000999,0002,277,376