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 20, 2026 22:40Charles CabergsCharles CabergsScore: 70,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 22:4170,71846,141,26424,154,0002,012,0002,351,104
2Apr 20, 2026 22:4170,81653,545,20724,187,0002,015,0002,351,104
3Apr 20, 2026 22:4170,85955,658,37524,202,0002,016,0002,347,008
4Apr 20, 2026 22:4170,90552,695,57626,235,00002,363,392
5Apr 20, 2026 22:4170,95953,649,14124,236,0002,019,0002,252,800
6Apr 20, 2026 22:4170,99447,904,70224,248,0002,020,0002,355,200
7Apr 20, 2026 22:4170,99759,249,31024,249,0002,020,0002,355,200
8Apr 20, 2026 22:4171,20049,592,33824,318,0002,026,0002,252,800
9Apr 20, 2026 22:4171,22140,691,57225,339,0001,013,0002,506,752