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 11, 2026 03:10Josu San MartinJosu San MartinScore: 4,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 03:134,884182,949,544158,183,0003,003,0002,289,664
2Jan 11, 2026 03:134,885188,090,339160,206,0001,001,0002,289,664
3Jan 11, 2026 03:134,886187,896,365160,246,0001,001,0002,289,664
4Jan 11, 2026 03:104,944189,811,008161,147,0002,001,0002,400,256
5Jan 11, 2026 03:124,946187,171,530162,223,0001,001,0002,392,064
6Jan 11, 2026 03:124,947184,410,984162,261,0001,001,0002,273,280
7Jan 11, 2026 03:104,949188,242,859163,324,00002,289,664
8Jan 11, 2026 03:104,957188,908,544162,599,000997,0002,289,664
9Jan 11, 2026 03:124,980191,049,686162,336,0002,004,0002,289,664