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 27, 2026 06:01olliecrowolliecrowScore: 27,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 06:023,39444,074,56424,851,0002,982,0002,457,600
2Apr 27, 2026 06:023,40447,308,12624,924,0002,990,0002,355,200
3Apr 27, 2026 06:0227,563242,286,446221,018,0005,000,0002,400,256
4Apr 27, 2026 06:0227,605245,952,413219,352,0007,011,0002,306,048
5Apr 27, 2026 06:0227,610248,016,575223,398,0003,005,0002,449,408
6Apr 27, 2026 06:0227,640245,352,548220,659,0005,990,0002,400,256
7Apr 27, 2026 06:0227,694248,671,691222,093,0005,002,0002,306,048
8Apr 27, 2026 06:0227,704248,649,232221,173,0006,004,0002,547,712
9Apr 27, 2026 06:0227,711247,081,400220,225,0007,007,0002,560,000