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 listMar 21, 2026 10:20Dominique GarmierDominique GarmierScore: 10,771,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 10:2010,155,40819,632,233,468518,969,0003,238,532,000274,432
2Mar 21, 2026 10:2010,771,37618,181,991,588583,869,0003,401,540,000274,432
3Mar 21, 2026 10:2010,798,34316,430,224,794547,298,0003,448,089,000307,200