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 08:13Rajarshi BasuRajarshi BasuScore: 7,950Success
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 08:267,761280,468,882251,126,0005,002,0002,441,216
2Dec 19, 2025 08:267,790283,684,836251,063,0006,001,0002,289,664
3Dec 19, 2025 08:267,826283,801,213252,256,0006,006,0002,412,544
4Dec 19, 2025 08:267,916288,180,938255,227,0006,005,0002,514,944
5Dec 19, 2025 08:267,917285,938,471253,250,0008,007,0002,514,944
6Dec 19, 2025 08:137,933291,522,149253,797,0007,993,0002,383,872
7Dec 19, 2025 08:267,950291,398,009255,351,0007,009,0002,523,136
8Dec 19, 2025 08:137,951292,310,460255,358,0007,009,0002,265,088
9Dec 19, 2025 08:267,975291,751,929255,171,0008,005,0002,449,408
10Dec 19, 2025 08:267,992295,738,113256,728,0006,992,0002,445,312
11Dec 19, 2025 08:138,048293,319,109256,597,0008,985,0002,301,952
12Dec 19, 2025 08:268,298299,926,922268,826,0004,996,0002,351,104