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:47Josu San MartinJosu San MartinScore: 3,960Success
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:473,82659,118,28830,365,0001,012,0002,449,408
2Feb 7, 2026 04:473,92552,318,34929,164,0003,017,0002,322,432
3Feb 7, 2026 04:473,95657,422,40130,413,0002,027,0002,355,200
4Feb 7, 2026 04:473,96055,036,95831,457,0001,014,0002,523,136
5Feb 7, 2026 04:474,06662,112,17031,322,0002,020,0002,375,680
6Feb 7, 2026 04:4711,606114,299,66193,169,0002,003,0002,322,432