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 listApr 22, 2026 01:33olliecrowolliecrowScore: 32,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 01:3431,661281,988,335257,627,0001,997,0002,334,720
2Apr 22, 2026 01:3431,662274,289,257257,637,0001,997,0002,387,968
3Apr 22, 2026 01:3432,114283,096,348262,337,0001,001,0002,392,064
4Apr 22, 2026 01:3432,226276,774,928263,256,0001,000,0002,322,432
5Apr 22, 2026 01:3432,253279,710,311263,476,0001,001,0002,379,776
6Apr 22, 2026 01:3432,401282,540,649263,695,0001,997,0002,375,680
7Apr 22, 2026 01:3433,152291,632,336269,849,0001,998,0002,383,872
8Apr 22, 2026 01:3433,161288,288,312269,925,0001,999,0002,375,680
9Apr 22, 2026 01:3433,298287,096,855272,046,0001,000,0002,478,080