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 15:44Maya RebholzMaya RebholzScore: 32,568Success
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 15:4631,920271,286,224224,193,00037,559,0002,199,552
2Jun 16, 2026 15:4632,214273,312,581226,216,00037,945,0002,199,552
3Jun 16, 2026 15:4632,247274,790,321226,171,00038,257,0002,199,552
4Jun 16, 2026 15:4632,476275,857,338228,323,00037,988,0002,199,552
5Jun 16, 2026 15:4632,568276,429,643228,679,00038,380,0002,199,552
6Jun 16, 2026 15:4632,787278,153,114227,994,00040,864,0002,199,552
7Jun 16, 2026 15:4633,114281,176,700233,891,00037,648,0002,199,552
8Jun 16, 2026 15:4633,492284,195,495236,321,00038,315,0002,199,552
9Jun 16, 2026 15:4634,126289,015,969238,539,00041,296,0002,199,552