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 27, 2026 10:58Victor MerckléVictor MerckléScore: 12,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 11:003,21636,298,53024,320,0002,058,0002,138,112
2Jun 27, 2026 11:003,22134,177,68424,383,0002,037,0002,138,112
3Jun 27, 2026 11:003,23236,475,51124,431,0002,077,0002,138,112
4Jun 27, 2026 11:0012,792114,525,078102,681,0002,218,0002,138,112
5Jun 27, 2026 11:0012,827114,595,341103,006,0002,180,0002,138,112
6Jun 27, 2026 11:0012,836115,236,345103,242,0002,020,0002,138,112
7Jun 27, 2026 11:0012,848114,910,013103,211,0002,146,0002,138,112
8Jun 27, 2026 11:0012,884113,497,495103,548,0002,107,0002,138,112
9Jun 27, 2026 11:0012,951116,041,813103,920,0002,282,0002,138,112