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 listAug 19, 2026 09:14Victor MerckléVictor MerckléScore: 2,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 09:152,82331,298,40622,030,0001,120,0002,117,632stderr
2Aug 19, 2026 09:152,84631,639,39122,314,0001,028,0002,117,632stderr
3Aug 19, 2026 09:152,85031,537,39422,353,0001,018,0002,117,632stderr
4Aug 19, 2026 09:152,87331,836,05922,444,0001,120,0002,117,632stderr
5Aug 19, 2026 09:152,91932,061,27822,818,0001,118,0002,117,632stderr
6Aug 19, 2026 09:155,52053,471,11244,115,0001,149,0002,117,632stderr
7Aug 19, 2026 09:155,54353,588,75044,318,0001,137,0002,117,632stderr
8Aug 19, 2026 09:155,55254,614,96844,362,0001,166,0002,117,632stderr
9Aug 19, 2026 09:155,57554,004,06544,589,0001,129,0002,117,632stderr