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 22, 2026 22:56Dominique GarmierDominique GarmierScore: 31,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 22:5631,878292,869,918118,727,000142,673,0002,412,544
2Mar 22, 2026 22:5631,950291,616,875117,994,000143,993,0002,363,392
3Mar 22, 2026 22:5632,762295,984,021119,289,000149,362,0002,420,736