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 27, 2026 21:51TudyMTudyMScore: 28,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 21:5527,148241,667,969218,627,0003,993,0002,387,968
2Apr 27, 2026 21:5527,594245,663,484225,275,0001,001,0002,306,048
3Apr 27, 2026 21:5527,849244,413,944226,362,0002,003,0002,383,872
4Apr 27, 2026 21:5527,960247,465,847226,274,0003,003,0002,322,432
5Apr 27, 2026 21:5528,256249,429,130228,708,0002,996,0002,322,432
6Apr 27, 2026 21:5528,384251,323,775230,756,0001,997,0002,387,968
7Apr 27, 2026 21:5528,590246,935,078232,436,0002,003,0002,383,872
8Apr 27, 2026 21:5528,660250,561,947232,013,0003,000,0002,301,952
9Apr 27, 2026 21:5529,230257,401,237237,689,0001,997,0002,383,872