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 07:57Zhou180Zhou180Score: 21,847Success
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 07:583,53338,101,23427,942,0001,030,0002,117,632
2Jun 26, 2026 07:5821,098182,112,202170,996,0002,011,0002,117,632
3Jun 26, 2026 07:5821,435184,892,454173,761,0002,011,0002,117,632
4Jun 26, 2026 07:5821,650186,618,699175,516,0002,015,0002,117,632
5Jun 26, 2026 07:5821,847188,252,636177,139,0002,011,0002,117,632
6Jun 26, 2026 07:5821,974189,307,040178,176,0002,012,0002,117,632
7Jun 26, 2026 07:5822,002189,568,786178,414,0002,010,0002,117,632
8Jun 26, 2026 07:5822,190191,158,696179,950,0002,011,0002,117,632
9Jun 26, 2026 07:5822,210191,196,344180,110,0002,012,0002,117,632