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 listJun 8, 2026 01:21anboto1anboto1Score: 9,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:229,626327,375,448305,698,00011,963,0002,117,632
2Jun 8, 2026 01:229,652327,883,025306,540,00012,003,0002,117,632
3Jun 8, 2026 01:229,691329,185,748307,245,00012,589,0002,117,632
4Jun 8, 2026 01:229,695329,331,204307,576,00012,385,0002,117,632
5Jun 8, 2026 01:229,718330,002,457308,064,00012,654,0002,117,632
6Jun 8, 2026 01:229,822333,450,235311,390,00012,749,0002,117,632
7Jun 8, 2026 01:229,908336,225,091314,157,00012,810,0002,117,632
8Jun 8, 2026 01:229,964338,557,895316,633,00012,190,0002,117,632
9Jun 8, 2026 01:229,971338,391,815317,028,00012,040,0002,117,632