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 24, 2026 01:47Dominique GarmierDominique GarmierScore: 27,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 01:4727,014246,415,374220,518,000997,0002,387,968
2Mar 24, 2026 01:4727,793257,929,971226,901,000999,0002,387,968
3Mar 24, 2026 01:4728,495258,656,364232,664,000998,0002,392,064