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 18, 2026 05:58Josu San MartinJosu San MartinScore: 26,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 05:5826,507247,830,717213,354,0004,006,0002,519,040
2Jan 18, 2026 05:5826,583248,686,874211,982,0005,999,0002,277,376
3Jan 18, 2026 05:5826,594245,620,202215,070,0003,000,0002,523,136