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 listApr 27, 2026 10:37Charles CabergsCharles CabergsScore: 35,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:3834,8741,173,130,0761,144,867,0005,999,0002,469,888
2Apr 27, 2026 10:3834,9921,171,744,1091,148,747,0005,998,0002,322,432
3Apr 27, 2026 10:3835,4801,188,458,0701,163,867,0006,999,0002,461,696
4Apr 27, 2026 10:3835,5571,193,373,9261,167,398,0005,996,0002,469,888
5Apr 27, 2026 10:3835,6521,196,337,2801,170,521,0005,997,0002,473,984
6Apr 27, 2026 10:3836,1471,213,941,4451,184,874,0007,992,0002,457,600
7Apr 27, 2026 10:3837,5881,260,401,8331,232,447,0007,989,0002,465,792
8Apr 27, 2026 10:3837,6511,260,560,4851,237,512,0004,993,0002,461,696
9Apr 27, 2026 10:3837,8441,268,448,0191,240,889,0007,992,0002,322,432