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 2, 2026 05:32Rajarshi BasuRajarshi BasuScore: 11,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 05:3210,699118,242,22172,777,00014,954,0002,310,144
2Jan 2, 2026 05:3211,334116,615,47577,946,00014,989,0002,428,928
3Jan 2, 2026 05:32101,911867,879,014715,718,000119,952,0002,310,144