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 listJan 2, 2026 04:52Rajarshi BasuRajarshi BasuScore: 90,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:528,852100,551,43667,544,0005,040,0002,367,488
2Jan 2, 2026 04:529,620109,681,99573,892,0004,992,0002,355,200
3Jan 2, 2026 04:5285,723733,583,605591,937,000110,988,0002,408,448
4Jan 2, 2026 04:5290,531771,890,179620,462,000121,894,0002,281,472
5Jan 2, 2026 04:5299,928845,441,241698,495,000120,912,0002,269,184
6Jan 2, 2026 04:52117,310990,843,990848,069,000113,875,0002,281,472