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 23, 2025 03:41Ian MckibbenIan MckibbenScore: 15,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 03:4115,101520,744,043417,453,00080,894,0002,310,144
2Jun 23, 2025 03:4115,142529,964,198420,748,00078,952,0002,404,352
3Jun 23, 2025 03:4115,143521,941,561422,769,00076,958,0002,437,120
4Jun 23, 2025 03:4115,147526,122,663417,884,00081,977,0002,510,848
5Jun 23, 2025 03:4115,158531,630,757430,324,00069,890,0002,318,336
6Jun 23, 2025 03:4115,188529,916,389427,330,00073,884,0002,347,008
7Jun 23, 2025 03:4115,193522,409,151423,473,00077,903,0002,408,448
8Jun 23, 2025 03:4115,230522,068,227434,634,00067,942,0002,306,048
9Jun 23, 2025 03:4115,548539,183,083447,202,00065,882,0002,297,856