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 listJan 2, 2026 04:59Josu San MartinJosu San MartinScore: 60,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:5958,0191,942,637,0871,894,632,00019,985,0002,433,024
2Jan 2, 2026 04:5258,4521,962,374,6981,909,919,00018,989,0002,478,080
3Jan 2, 2026 04:5258,8071,970,895,3411,920,649,00019,985,0002,498,560
4Jan 2, 2026 04:5960,3922,023,334,9771,972,937,00019,989,0002,281,472
5Jan 2, 2026 04:5960,7502,029,764,8611,989,749,00014,990,0002,281,472
6Jan 2, 2026 04:5261,0972,047,781,5531,994,233,00021,980,0002,281,472