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 5, 2026 01:51olliecrowolliecrowScore: 3,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 01:533,27040,862,48125,764,0001,055,0002,314,240
2May 5, 2026 01:533,29041,144,36625,939,0001,047,0002,527,232
3May 5, 2026 01:533,29142,461,65225,915,0001,079,0002,498,560
4May 5, 2026 01:533,29543,603,52525,948,0001,077,0002,527,232
5May 5, 2026 01:533,31442,805,89826,103,0001,074,0002,502,656
6May 5, 2026 01:5323,491207,495,751190,613,0002,018,0002,306,048
7May 5, 2026 01:5323,529212,072,645190,917,0002,027,0002,314,240
8May 5, 2026 01:5323,584210,052,788191,374,0002,017,0002,510,848
9May 5, 2026 01:5323,594210,600,722191,412,0002,064,0002,478,080