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 06:32Zhou180Zhou180Score: 4,280Success
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 06:324,22643,851,02232,499,0002,160,0002,117,632
2Jun 26, 2026 06:324,23043,777,44732,534,0002,158,0002,117,632
3Jun 26, 2026 06:324,25344,213,16932,662,0002,218,0002,117,632
4Jun 26, 2026 06:324,27444,242,22732,860,0002,192,0002,117,632
5Jun 26, 2026 06:324,28044,232,52832,872,0002,225,0002,117,632
6Jun 26, 2026 06:324,29044,313,29132,938,0002,242,0002,117,632
7Jun 26, 2026 06:324,35344,790,71133,378,0002,320,0002,117,632
8Jun 26, 2026 06:3222,556194,232,972181,793,0003,173,0002,117,632
9Jun 26, 2026 06:3222,799196,117,686183,681,0003,275,0002,117,632