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 20, 2025 15:25Rajarshi BasuRajarshi BasuScore: 5,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 15:255,024192,555,928160,789,0004,993,0002,453,504
2Dec 20, 2025 15:255,052191,851,932160,728,0005,989,0002,375,680
3Dec 20, 2025 15:255,054191,154,810160,792,0005,992,0002,326,528
4Dec 20, 2025 15:255,062189,306,256161,059,0006,002,0002,441,216
5Dec 20, 2025 15:255,071193,675,147162,328,0005,010,0002,514,944
6Dec 20, 2025 15:255,098190,908,586163,240,0005,007,0002,387,968
7Dec 20, 2025 15:255,113193,551,177164,734,0003,993,0002,363,392
8Dec 20, 2025 15:255,261193,558,366168,620,0004,988,0002,523,136
9Dec 20, 2025 15:255,513201,774,344176,934,0004,998,0002,519,040