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 listMar 12, 2026 20:35Josu San MartinJosu San MartinScore: 11,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 20:353,35056,549,57626,451,0001,017,0002,502,656
2Mar 12, 2026 20:3511,194117,399,18390,790,000997,0002,404,352
3Mar 12, 2026 20:3511,269119,114,57491,398,0001,004,0002,457,600