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 20:20Dominique GarmierDominique GarmierScore: 30,857Success
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 20:2030,025272,854,757241,199,0005,004,0002,412,544
2Mar 22, 2026 20:2030,857282,005,043248,027,0005,000,0002,387,968
3Mar 22, 2026 20:2032,251286,353,107259,452,0005,008,0002,408,448