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 16, 2026 01:37olliecrowolliecrowScore: 3,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 01:373,52756,495,86226,929,0001,994,0002,347,008
2Apr 16, 2026 01:373,59250,056,37527,421,0002,031,0002,322,432
3Apr 16, 2026 01:3719,339193,786,351154,593,0003,989,0002,400,256