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 01:33Dominique GarmierDominique GarmierScore: 12,500Success
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:3312,498125,225,200101,478,0001,004,0002,375,680
2Mar 23, 2026 01:3312,500134,181,866100,490,0002,009,0002,355,200
3Mar 23, 2026 01:3312,537132,390,329100,807,0001,996,0002,387,968