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 29, 2026 11:21Victor MerckléVictor MerckléScore: 2,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 11:242,73530,766,00421,323,0001,111,0002,117,632stderr
2Aug 29, 2026 11:242,74130,559,27521,363,0001,117,0002,117,632stderr
3Aug 29, 2026 11:242,75430,684,16021,452,0001,131,0002,117,632stderr
4Aug 29, 2026 11:242,76730,804,15921,667,0001,030,0002,117,632stderr
5Aug 29, 2026 11:242,78131,029,14221,781,0001,026,0002,117,632stderr
6Aug 29, 2026 11:242,84631,467,45922,273,0001,067,0002,117,632stderr
7Aug 29, 2026 11:245,41252,515,15243,247,0001,138,0002,117,632stderr
8Aug 29, 2026 11:245,46753,298,35843,658,0001,177,0002,117,632stderr
9Aug 29, 2026 11:245,57553,840,03544,682,0001,039,0002,117,632stderr