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 listMay 3, 2026 14:23TudyMTudyMScore: 12,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 14:2912,637116,985,384102,604,0001,023,0002,441,216
2May 3, 2026 14:2912,639118,059,819102,626,0001,021,0002,543,616
3May 3, 2026 14:2912,651119,381,316102,720,0001,024,0002,482,176
4May 3, 2026 14:2912,680119,207,864101,962,0002,017,0002,375,680
5May 3, 2026 14:2912,715119,133,815102,205,0002,065,0002,314,240
6May 3, 2026 14:2912,775120,702,678102,651,0002,111,0002,469,888
7May 3, 2026 14:2912,819121,393,580103,042,0002,074,0002,519,040
8May 3, 2026 14:2912,880120,827,150103,409,0002,210,0002,330,624
9May 3, 2026 14:2912,891120,774,630103,654,0002,058,0002,400,256