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 9, 2026 00:37olliecrowolliecrowScore: 39,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 00:3712,694133,874,358101,086,0003,002,0002,326,528
2Apr 9, 2026 00:3739,821353,227,030322,539,0003,994,0002,355,200
3Apr 9, 2026 00:3740,173356,023,065323,428,0005,989,0002,359,296