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 listMar 23, 2026 03:29Dominique GarmierDominique GarmierScore: 27,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 01:2726,759244,110,907218,424,0001,001,0002,371,584
2Mar 23, 2026 01:2727,041248,658,501218,751,0002,982,0002,519,040
3Mar 23, 2026 01:2727,205247,193,909221,081,0002,000,0002,375,680
4Mar 23, 2026 03:2927,280249,403,039222,700,000998,0002,519,040
5Mar 23, 2026 03:2927,488248,750,515225,402,00002,387,968
6Mar 23, 2026 03:2927,601249,701,407226,325,00002,519,040