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 9, 2026 23:01Josu San MartinJosu San MartinScore: 5,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 23:005,859218,785,800188,337,0005,008,0002,473,984
2Jan 9, 2026 23:005,877224,930,359191,952,0001,999,0002,273,280
3Jan 9, 2026 23:005,882216,702,107190,108,0004,002,0002,375,680
4Jan 9, 2026 23:015,887226,218,301190,257,0004,005,0002,433,024
5Jan 9, 2026 23:015,899219,249,768190,684,0003,993,0002,367,488
6Jan 9, 2026 23:015,900217,545,087191,692,0002,995,0002,375,680
7Jan 9, 2026 23:015,904220,585,733190,823,0003,996,0002,379,776
8Jan 9, 2026 23:015,927222,927,902191,612,0003,991,0002,506,752
9Jan 9, 2026 23:015,976222,758,962191,215,0006,006,0002,449,408