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 30, 2026 01:53Dominique GarmierDominique GarmierScore: 18,266Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 01:5318,210172,087,673148,320,0001,002,0002,310,144
2Mar 30, 2026 01:5318,266179,402,213147,785,0001,997,0002,301,952
3Mar 30, 2026 01:5318,315174,216,655148,182,0002,002,0002,289,664