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 10, 2026 04:06olliecrowolliecrowScore: 977,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 04:06970,4297,994,397,9257,757,709,000199,812,0002,277,376
2Mar 10, 2026 04:06977,3818,047,087,2787,815,683,000198,839,0002,277,376
3Mar 10, 2026 04:06986,1428,123,209,5457,807,631,000278,736,0002,277,376