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 01:19Charles CabergsCharles CabergsScore: 9,622Success
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 01:204,65552,463,78836,166,0002,009,0002,363,392
2Apr 26, 2026 01:204,66859,385,28837,274,0001,007,0002,355,200
3Apr 26, 2026 01:204,69557,010,64636,476,0002,026,0002,351,104
4Apr 26, 2026 01:209,51295,085,96776,004,0002,000,0002,387,968
5Apr 26, 2026 01:209,62293,891,25972,911,0005,992,0002,379,776
6Apr 26, 2026 01:209,62598,440,69073,937,0004,995,0002,367,488
7Apr 26, 2026 01:209,62692,016,34275,937,0002,997,0002,297,856
8Apr 26, 2026 01:209,642101,511,39877,068,0002,001,0002,396,160
9Apr 26, 2026 01:209,64694,429,57374,097,0005,006,0002,392,064