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 18:19Dominique GarmierDominique GarmierScore: 22,341Success
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 18:1922,235219,499,029182,331,00002,289,664
2Mar 25, 2026 18:1922,341210,970,782182,199,0001,001,0002,441,216
3Mar 25, 2026 18:1922,354209,445,301182,301,0001,001,0002,461,696