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 26, 2026 09:05Zhou180Zhou180Score: 21,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 09:053,44237,490,72427,180,0001,051,0002,117,632
2Jun 26, 2026 09:053,46137,505,71227,344,0001,042,0002,117,632
3Jun 26, 2026 09:053,46137,523,04027,339,0001,047,0002,117,632
4Jun 26, 2026 09:053,52038,092,66527,827,0001,037,0002,117,632
5Jun 26, 2026 09:0521,851188,390,600176,181,0003,004,0002,117,632
6Jun 26, 2026 09:0521,938189,102,056177,888,0002,011,0002,117,632
7Jun 26, 2026 09:0522,037189,861,113178,695,0002,012,0002,117,632
8Jun 26, 2026 09:0522,199192,737,297178,997,0003,035,0002,117,632
9Jun 26, 2026 09:0522,381192,753,204181,518,0002,011,0002,117,632