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 21, 2026 01:27Taylor DettlingTaylor DettlingScore: 294,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 01:28293,667132,674,69353,830,00054,827,0002,318,336
2Apr 21, 2026 01:28294,197125,401,41456,923,00051,930,0002,281,472
3Apr 21, 2026 01:28295,364126,734,29658,690,00050,595,0002,281,472