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 21, 2026 08:34olliecrowolliecrowScore: 96,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 08:3594,7773,155,314,8243,115,657,00011,994,0002,334,720
2Mar 21, 2026 08:3495,1833,170,685,1443,124,040,00016,994,0002,334,720
3Mar 21, 2026 08:3595,4463,179,954,4683,133,735,00015,993,0002,437,120
4Mar 21, 2026 08:3496,3883,214,783,5773,166,806,00013,990,0002,396,160
5Mar 21, 2026 08:3596,5993,218,194,7043,170,781,00016,988,0002,334,720
6Mar 21, 2026 08:3497,0973,237,469,8093,190,198,00013,992,0002,404,352