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 27, 2026 01:42Dominique GarmierDominique GarmierScore: 28,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 01:4227,834254,702,744227,236,0001,001,0002,404,352
2Mar 27, 2026 01:4228,141257,479,911227,763,0002,996,0002,269,184
3Mar 27, 2026 01:4228,219256,734,753230,395,000997,0002,355,200