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 21, 2025 11:43Rajarshi BasuRajarshi BasuScore: 5,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 11:435,023190,571,516162,751,0002,995,0002,510,848
2Dec 21, 2025 11:435,039196,536,000160,270,0006,010,0002,514,944
3Dec 21, 2025 11:435,063195,757,095162,075,0005,002,0002,306,048
4Dec 21, 2025 11:435,073194,238,865162,389,0005,012,0002,342,912
5Dec 21, 2025 11:435,081192,729,414162,683,0004,990,0002,514,944
6Dec 21, 2025 11:435,083195,704,859161,759,0005,991,0002,428,928
7Dec 21, 2025 11:435,089198,475,223162,926,0004,997,0002,396,160
8Dec 21, 2025 11:435,105195,005,448161,503,0006,978,0002,514,944
9Dec 21, 2025 11:435,121196,126,797163,984,0004,999,0002,510,848