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 16:23Dominique GarmierDominique GarmierScore: 11,849Success
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 16:2311,798121,451,76894,747,0001,994,0002,396,160
2Mar 23, 2026 16:2311,849124,359,14394,156,0003,004,0002,392,064
3Mar 23, 2026 16:2311,851128,129,64595,178,0002,003,0002,453,504