Unique strings Sergey Svistunov

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 listMar 22, 2026 12:24olliecrowolliecrowScore: 9,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 12:299,721341,389,979273,811,00046,967,0002,478,080
2Mar 22, 2026 12:299,741344,418,176285,396,00036,050,0002,416,640
3Mar 22, 2026 12:249,744350,993,877283,598,00037,946,0002,494,464
4Mar 22, 2026 12:249,772351,396,748280,535,00041,930,0002,523,136
5Mar 22, 2026 12:299,803348,252,120283,554,00039,937,0002,490,368
6Mar 22, 2026 12:2410,415392,096,120296,741,00046,959,0002,342,912