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 23, 2026 02:13Charles CabergsCharles CabergsScore: 5,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 02:155,53662,249,10940,357,0005,044,0002,387,968
2Apr 23, 2026 02:155,55366,464,10442,500,0003,035,0002,392,064
3Apr 23, 2026 02:155,55464,341,57643,521,0002,024,0002,441,216
4Apr 23, 2026 02:155,56365,043,10243,596,0002,027,0002,375,680
5Apr 23, 2026 02:155,65966,893,16343,385,0003,026,0002,293,760
6Apr 23, 2026 02:155,66167,910,38244,408,0002,018,0002,334,720
7Apr 23, 2026 02:155,68760,918,04943,595,0003,041,0002,347,008
8Apr 23, 2026 02:155,69463,039,87844,666,0002,030,0002,367,488
9Apr 23, 2026 02:155,70665,967,37841,819,0004,978,0002,347,008