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 16, 2026 19:17Maya RebholzMaya RebholzScore: 34,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 19:1833,368283,261,506234,067,00039,555,0002,281,472
2Jun 16, 2026 19:1833,945287,982,297238,859,00039,495,0002,281,472
3Jun 16, 2026 19:1834,264290,605,700241,115,00039,854,0002,281,472
4Jun 16, 2026 19:1834,271290,662,403240,828,00040,200,0002,281,472
5Jun 16, 2026 19:1834,489292,719,604240,622,00042,190,0002,281,472
6Jun 16, 2026 19:1834,549292,556,157239,667,00043,641,0002,281,472
7Jun 16, 2026 19:1834,873295,579,253246,099,00039,863,0002,281,472
8Jun 16, 2026 19:1835,151298,631,556246,633,00041,610,0002,281,472
9Jun 16, 2026 19:1835,642301,934,563251,489,00040,783,0002,281,472