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 listNov 23, 2025 07:45RacRacScore: 2,089,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2025 07:452,053,997786,846,453644,135,000115,844,0002,519,040
2Nov 23, 2025 07:452,058,541795,265,877650,855,000110,805,0002,523,136
3Nov 23, 2025 07:452,068,781795,412,469647,534,000117,915,0002,306,048
4Nov 23, 2025 07:452,077,311799,355,434650,819,000117,786,0002,293,760
5Nov 23, 2025 07:452,089,032799,636,723662,094,000110,848,0002,355,200
6Nov 23, 2025 07:452,089,459800,718,616661,231,000111,869,0002,297,856
7Nov 23, 2025 07:452,099,603801,442,496655,033,000121,820,0002,392,064
8Nov 23, 2025 07:452,100,659808,406,094662,356,000114,888,0002,306,048
9Nov 23, 2025 07:452,120,738811,590,666671,720,000112,953,0002,347,008