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 listMay 3, 2026 19:02TudyMTudyMScore: 24,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:0624,660831,261,288795,635,00018,147,0002,539,520
2May 3, 2026 19:0624,662833,569,037795,820,00018,036,0002,539,520
3May 3, 2026 19:0624,686831,392,357795,560,00019,101,0002,523,136
4May 3, 2026 19:0624,751837,262,440798,339,00018,466,0002,535,424
5May 3, 2026 19:0624,753836,035,338798,659,00018,192,0002,543,616
6May 3, 2026 19:0624,783836,423,288799,224,00018,621,0002,539,520
7May 3, 2026 19:0624,807832,450,151800,603,00018,037,0002,543,616
8May 3, 2026 19:0624,821834,014,729800,936,00018,187,0002,531,328
9May 3, 2026 19:0624,828834,415,512801,166,00018,164,0002,535,424