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 5, 2026 09:05Rajarshi BasuRajarshi BasuScore: 79,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 09:054,89365,070,63736,110,0004,012,0002,277,376
2Jan 5, 2026 09:0579,786683,118,488524,595,000129,652,0002,465,792
3Jan 5, 2026 09:0585,191724,906,346575,640,000122,923,0002,297,856