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 25, 2026 02:23Dominique GarmierDominique GarmierScore: 10,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 02:2310,784114,703,22486,417,0002,009,0002,539,520
2Mar 25, 2026 02:2310,907114,123,50089,437,00002,523,136
3Mar 25, 2026 02:2310,945117,926,31588,754,000997,0002,363,392