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 27, 2026 13:34Charles CabergsCharles CabergsScore: 9,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 13:354,67955,940,77437,364,0001,009,0002,334,720
2Apr 27, 2026 13:354,69454,431,15535,456,0003,039,0002,347,008
3Apr 27, 2026 13:359,50998,881,90274,977,0002,999,0002,379,776
4Apr 27, 2026 13:359,51394,354,20175,011,0003,000,0002,379,776
5Apr 27, 2026 13:359,59497,569,53872,703,0005,975,0002,359,296
6Apr 27, 2026 13:359,614101,203,40974,847,0003,991,0002,396,160
7Apr 27, 2026 13:359,66298,966,45576,225,0003,008,0002,383,872
8Apr 27, 2026 13:359,75196,808,68576,963,0002,998,0002,326,528
9Apr 27, 2026 13:359,78298,097,20978,236,0001,980,0002,506,752