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 10:10Rajarshi BasuRajarshi BasuScore: 4,958Success
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 10:104,929193,710,890158,679,0003,991,0002,465,792
2Dec 22, 2025 10:104,947189,785,543158,246,0005,007,0002,347,008
3Dec 22, 2025 10:104,948189,989,592160,295,0003,005,0002,510,848
4Dec 22, 2025 10:104,957189,266,631158,594,0004,987,0002,510,848
5Dec 22, 2025 10:104,958194,100,707160,614,0002,992,0002,510,848
6Dec 22, 2025 10:104,970186,989,312159,019,0005,000,0002,510,848
7Dec 22, 2025 10:104,976186,857,979159,207,0005,006,0002,314,240
8Dec 22, 2025 10:105,001193,744,202161,021,0004,000,0002,514,944
9Dec 22, 2025 10:105,129197,735,143165,282,0003,982,0002,506,752