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 16:11Maya RebholzMaya RebholzScore: 26,521Success
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 16:1326,102223,672,024187,456,00026,587,0002,199,552
2Jun 16, 2026 16:1326,150224,096,710188,160,00026,275,0002,199,552
3Jun 16, 2026 16:1326,427226,275,017190,334,00026,373,0002,199,552
4Jun 16, 2026 16:1326,435226,391,654190,263,00026,508,0002,199,552
5Jun 16, 2026 16:1326,521226,739,206188,937,00028,541,0002,199,552
6Jun 16, 2026 16:1327,072231,466,367195,146,00026,850,0002,199,552
7Jun 16, 2026 16:1327,160232,383,333195,637,00027,076,0002,199,552
8Jun 16, 2026 16:1327,259233,108,234196,681,00026,846,0002,199,552
9Jun 16, 2026 16:1327,517235,250,593198,782,00026,861,0002,199,552