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 listApr 17, 2026 10:20olliecrowolliecrowScore: 3,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 10:203,37454,773,09026,639,0001,024,0002,486,272
2Apr 17, 2026 10:203,39460,870,62125,840,0001,987,0002,387,968
3Apr 17, 2026 10:203,43460,197,21327,150,0001,005,0002,306,048