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 listJun 17, 2026 16:35Maya RebholzMaya RebholzScore: 13,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 16:3613,261118,003,534106,541,0002,203,0002,113,536
2Jun 17, 2026 16:3613,360129,684,132106,257,0003,299,0002,113,536
3Jun 17, 2026 16:3613,540120,657,628107,724,0003,312,0002,113,536
4Jun 17, 2026 16:3613,641121,054,906109,652,0002,209,0002,113,536
5Jun 17, 2026 16:3613,690121,567,319108,997,0003,264,0002,113,536
6Jun 17, 2026 16:3613,913123,427,448110,820,0003,269,0002,113,536
7Jun 17, 2026 16:3613,924123,823,556110,888,0003,291,0002,113,536
8Jun 17, 2026 16:3614,395127,381,559114,705,0003,341,0002,113,536
9Jun 17, 2026 16:3615,546145,233,158123,709,0003,776,0002,113,536