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 listJan 13, 2026 21:45Josu San MartinJosu San MartinScore: 69,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 21:4569,08649,886,69024,540,0001,022,0002,367,488
2Jan 13, 2026 21:4569,30854,999,00124,619,0001,025,0002,289,664
3Jan 13, 2026 21:4569,80053,782,38923,840,0001,986,0002,359,296