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 listJan 19, 2026 21:07Pavel SkripkinPavel SkripkinScore: 44,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2026 21:0743,7951,467,386,1881,440,244,0004,997,0002,506,752
2Jan 19, 2026 21:0743,8871,468,129,0421,442,286,0005,997,0002,437,120
3Jan 19, 2026 21:0743,9301,479,464,1731,445,699,0003,999,0002,371,584
4Jan 19, 2026 21:0743,9871,477,858,8241,447,576,0003,998,0002,437,120
5Jan 19, 2026 21:0744,1541,485,282,3941,450,097,0006,995,0002,281,472
6Jan 19, 2026 21:0744,2441,483,169,4131,455,050,0004,996,0002,465,792
7Jan 19, 2026 21:0744,3671,485,232,7401,457,117,0006,995,0002,433,024
8Jan 19, 2026 21:0744,4721,489,217,0361,462,585,0004,998,0002,281,472
9Jan 19, 2026 21:0744,5471,497,596,3001,464,041,0005,996,0002,351,104