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 listAug 11, 2025 20:18Leon ZhaoLeon ZhaoScore: 53,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 20:1853,1601,782,812,2341,629,402,000124,877,0002,465,792
2Aug 11, 2025 20:1853,2411,784,403,0751,638,013,000118,928,0002,445,312
3Aug 11, 2025 20:1853,6961,799,905,6701,649,117,000122,859,0002,277,376