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 listNov 4, 2026 04:22e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 04:2201,132,706,807982,021,000139,696,0002,113,536expected "2061412562 ", got "2061412509 "
2Nov 4, 2026 04:2201,447,055,6791,294,938,000141,150,0002,113,536expected "2266426238 ", got "2266426208 "
3Nov 4, 2026 04:220927,259,324775,856,000139,970,0002,113,536expected "2136980656 ", got "2136980641 "