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 listMay 13, 2026 19:00Pavel SkripkinPavel SkripkinScore: 12,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:0111,463385,957,421375,064,0003,220,0002,117,632
2May 13, 2026 19:0111,545388,452,914377,815,0003,193,0002,117,632
3May 13, 2026 19:0111,929401,534,599390,393,0003,288,0002,117,632
4May 13, 2026 19:0112,015404,078,022391,435,0005,079,0002,117,632
5May 13, 2026 19:0112,159410,360,820398,189,0003,080,0002,117,632
6May 13, 2026 19:0112,323415,707,673403,356,0003,304,0002,117,632
7May 13, 2026 19:0112,523420,672,301409,931,0003,336,0002,117,632
8May 13, 2026 19:0112,737427,620,933416,879,0003,459,0002,117,632
9May 13, 2026 19:0113,501454,941,834442,203,0003,361,0002,117,632