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 26, 2026 17:07TudyMTudyMScore: 101,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 17:0778,445657,467,695464,461,000178,792,0002,469,888
2Apr 26, 2026 17:07101,015846,953,577658,463,000169,861,0002,555,904
3Apr 26, 2026 17:07102,165852,398,930657,813,000179,948,0002,441,216