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 19, 2025 19:10Josu San MartinJosu San MartinScore: 66,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 19:1064,2492,148,259,2702,109,214,00010,995,0002,285,568
2Dec 19, 2025 19:1064,5352,153,726,2752,114,669,00014,990,0002,400,256
3Dec 19, 2025 19:1064,7742,170,746,6882,125,535,00011,991,0002,465,792
4Dec 19, 2025 19:1064,8592,170,037,8252,130,366,0009,997,0002,281,472
5Dec 19, 2025 19:1066,7212,228,151,2422,192,783,0008,995,0002,490,368
6Dec 19, 2025 19:1066,8982,236,036,5842,194,658,00012,992,0002,473,984
7Dec 19, 2025 19:1066,9692,237,791,9342,199,982,0009,995,0002,285,568
8Dec 19, 2025 19:1067,2702,246,939,5252,210,915,0008,995,0002,281,472
9Dec 19, 2025 19:1067,3002,249,084,0352,209,897,00010,994,0002,285,568