TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJul 8, 2026 21:42IlyaIlyaScore: 59,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:4458,36431,198,75420,483,0001,112,0002,113,536
2Jul 8, 2026 21:4458,46231,308,13220,502,0001,129,0002,113,536
3Jul 8, 2026 21:4458,52131,289,66420,538,0001,115,0002,113,536
4Jul 8, 2026 21:4458,53231,296,98020,548,0001,109,0002,113,536
5Jul 8, 2026 21:4459,01032,602,21420,799,0001,035,0002,113,536
6Jul 8, 2026 21:4421,516,5057,971,077,0277,809,914,000151,193,0002,113,536
7Jul 8, 2026 21:4421,548,4757,982,786,1617,822,557,000150,379,0002,113,536
8Jul 8, 2026 21:4421,555,2487,985,511,0617,824,432,000151,010,0002,113,536
9Jul 8, 2026 21:4421,681,1898,032,444,4697,868,540,000153,500,0002,113,536