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:50RacRacScore: 2,184,546Success
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:501,581,062608,001,502469,995,000114,998,0002,457,600
2Nov 23, 2025 07:502,184,546830,950,800688,389,000119,893,0002,297,856
3Nov 23, 2025 07:502,414,611915,562,157770,488,000122,918,0002,297,856