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 listDec 22, 2025 09:41Rajarshi BasuRajarshi BasuScore: 4,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 09:414,966189,821,439160,871,0002,997,0002,510,848
2Dec 22, 2025 09:414,977188,266,917160,238,0004,005,0002,510,848
3Dec 22, 2025 09:414,978191,311,183160,258,0004,006,0002,375,680
4Dec 22, 2025 09:414,984192,928,696160,461,0004,011,0002,510,848
5Dec 22, 2025 09:414,991188,194,150161,710,0002,994,0002,510,848
6Dec 22, 2025 09:414,997192,368,999161,896,0002,998,0002,510,848
7Dec 22, 2025 09:415,009192,190,882161,290,0004,007,0002,519,040
8Dec 22, 2025 09:415,022188,017,823162,735,0002,995,0002,420,736
9Dec 22, 2025 09:415,069196,237,345163,264,0004,006,0002,334,720