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 05:56Rajarshi BasuRajarshi BasuScore: 5,099Success
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 05:565,044191,768,189160,432,0006,016,0002,379,776
2Dec 21, 2025 05:565,045196,287,775161,512,0004,984,0002,306,048
3Dec 21, 2025 05:565,082194,095,069164,705,0002,994,0002,338,816
4Dec 21, 2025 05:565,093196,700,192161,071,0007,003,0002,514,944
5Dec 21, 2025 05:565,099195,359,666162,291,0005,973,0002,383,872
6Dec 21, 2025 05:565,105193,084,846164,454,0004,011,0002,510,848
7Dec 21, 2025 05:565,160205,115,020165,276,0005,008,0002,531,328
8Dec 21, 2025 05:565,240198,020,422169,932,0002,998,0002,326,528
9Dec 21, 2025 05:565,241205,045,896170,967,0001,999,0002,269,184