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 listNov 5, 2026 01:30e1011e1011Score: 16,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 01:3116,661148,048,388134,461,0002,166,0002,113,536
2Nov 5, 2026 01:3116,730148,987,822135,061,0002,131,0002,117,632
3Nov 5, 2026 01:3116,756148,909,208135,244,0002,156,0002,113,536
4Nov 5, 2026 01:3116,789149,140,762135,657,0002,018,0002,113,536
5Nov 5, 2026 01:3116,797149,150,463135,714,0002,028,0002,113,536
6Nov 5, 2026 01:3116,800149,501,090135,750,0002,011,0002,113,536
7Nov 5, 2026 01:3116,848149,574,796136,144,0002,014,0002,113,536
8Nov 5, 2026 01:3116,868149,709,387136,307,0002,011,0002,113,536
9Nov 5, 2026 01:3116,921149,590,586136,748,0002,012,0002,113,536