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 listFeb 7, 2026 04:03Josu San MartinJosu San MartinScore: 3,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 04:253,43756,598,00325,162,0003,019,0002,437,120
2Feb 7, 2026 04:253,43959,753,33526,188,0002,014,0002,371,584
3Feb 7, 2026 04:253,44557,147,46224,212,0004,035,0002,490,368
4Feb 7, 2026 04:253,45752,817,48725,309,0003,037,0002,322,432
5Feb 7, 2026 04:033,46262,625,30426,360,0002,027,0002,306,048
6Feb 7, 2026 04:033,46851,386,21228,438,00002,306,048
7Feb 7, 2026 04:033,46951,186,77427,433,0001,016,0002,342,912
8Feb 7, 2026 04:033,49953,256,07127,667,0001,024,0002,342,912
9Feb 7, 2026 04:0311,240115,608,79091,170,0001,001,0002,523,136
10Feb 7, 2026 04:2511,275119,984,95290,443,0002,009,0002,289,664
11Feb 7, 2026 04:2511,284121,614,68490,519,0002,011,0002,342,912
12Feb 7, 2026 04:0311,461121,655,09791,978,0001,999,0002,502,656