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 20, 2026 02:17Dominique GarmierDominique GarmierScore: 18,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 02:1718,179175,856,586147,064,0002,000,0002,363,392
2Mar 16, 2026 10:5518,686175,529,571152,228,0001,001,0002,363,392
3Mar 16, 2026 10:5518,770179,470,755150,913,0002,998,0002,453,504
4Mar 16, 2026 10:5518,771182,072,336151,926,0001,999,0002,445,312
5Mar 20, 2026 02:1718,839177,613,407154,483,00002,379,776
6Mar 20, 2026 02:1719,032181,321,411155,059,0001,000,0002,453,504