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 listApr 20, 2026 15:58Dominique GarmierDominique GarmierScore: 12,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:0012,774129,760,738102,757,0001,995,0002,408,448
2Apr 20, 2026 16:0012,806130,845,863103,013,0002,000,0002,289,664
3Apr 20, 2026 16:0012,860136,402,232104,449,0001,004,0002,289,664