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 13, 2026 04:06Josu San MartinJosu San MartinScore: 3,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 04:073,504124,765,839114,561,0001,076,0002,113,536
2May 13, 2026 04:073,517124,874,863115,030,0001,033,0002,113,536
3May 13, 2026 04:073,519126,685,308115,024,0001,122,0002,113,536
4May 13, 2026 04:073,523125,885,509115,141,0001,119,0002,113,536
5May 13, 2026 04:073,523127,867,168115,158,0001,116,0002,113,536
6May 13, 2026 04:073,524125,451,587115,175,0001,123,0002,113,536
7May 13, 2026 04:073,525126,118,342115,209,0001,120,0002,113,536
8May 13, 2026 04:073,526125,154,013115,242,0001,124,0002,113,536
9May 13, 2026 04:073,529126,772,438115,350,0001,126,0002,113,536