Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listNov 8, 2026 06:13highload-churnerhighload-churnerScore: 1,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 06:141,41142,352,61798,057,000073,728
2Nov 8, 2026 06:141,42042,609,57698,754,0000339,968
3Nov 8, 2026 06:141,42442,731,45598,409,0000327,680
4Nov 8, 2026 06:141,42842,852,64098,123,0001,049,000339,968
5Nov 8, 2026 06:141,43042,916,91798,649,000094,208
6Nov 8, 2026 06:141,44343,294,672100,956,0000327,680
7Nov 8, 2026 06:141,44343,292,33997,477,0003,161,000339,968
8Nov 8, 2026 06:141,44543,377,73897,555,0003,106,000327,680
9Nov 8, 2026 06:141,47044,122,96099,971,0003,142,000327,680