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,086Success
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,062190,375,998161,056,0006,002,0002,289,664
2Dec 20, 2025 15:255,071197,366,399161,347,0006,012,0002,531,328
3Dec 20, 2025 15:255,073194,997,606162,391,0005,012,0002,359,296
4Dec 20, 2025 15:255,082194,878,261161,719,0005,989,0002,506,752
5Dec 20, 2025 15:255,086193,590,794163,858,0003,996,0002,347,008
6Dec 20, 2025 15:255,089189,956,259161,939,0005,997,0002,519,040
7Dec 20, 2025 15:255,104196,750,951163,416,0005,012,0002,510,848
8Dec 20, 2025 15:255,240200,642,684166,913,0005,996,0002,519,040
9Dec 20, 2025 15:255,435205,988,078174,331,0005,009,0002,387,968