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 listApr 26, 2026 17:03TudyMTudyMScore: 224,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 17:03224,162102,370,62639,971,00042,969,0002,363,392
2Apr 26, 2026 17:03224,440102,925,76438,020,00045,023,0002,359,296
3Apr 26, 2026 17:03226,181100,238,50136,298,00047,389,0002,363,392