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 listFeb 7, 2026 03:55Josu San MartinJosu San MartinScore: 3,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 03:553,42954,144,13626,113,0002,008,0002,334,720
2Feb 7, 2026 03:553,43358,277,45326,141,0002,010,0002,355,200
3Feb 7, 2026 03:553,45256,047,36825,276,0003,033,0002,412,544
4Feb 7, 2026 03:553,45557,354,76026,306,0002,023,0002,281,472
5Feb 7, 2026 03:553,46454,035,80027,387,0001,014,0002,473,984
6Feb 7, 2026 03:553,46947,617,57426,412,0002,031,0002,375,680
7Feb 7, 2026 03:5511,216118,439,78789,970,0001,999,0002,514,944
8Feb 7, 2026 03:5511,248124,262,06990,230,0002,005,0002,400,256
9Feb 7, 2026 03:5511,256114,979,62991,299,0001,003,0002,367,488