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 listSep 15, 2026 03:49Josu San MartinJosu San MartinScore: 3,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 03:503,366121,310,700110,072,0001,013,0002,113,536
2Sep 15, 2026 03:503,370121,430,681110,208,0001,015,0002,113,536
3Sep 15, 2026 03:503,376121,643,319110,397,0001,020,0002,113,536
4Sep 15, 2026 03:503,384121,895,754110,655,0001,031,0002,113,536
5Sep 15, 2026 03:503,389122,101,507110,821,0001,027,0002,113,536
6Sep 15, 2026 03:503,397122,393,211111,100,0001,028,0002,113,536
7Sep 15, 2026 03:503,410122,721,068111,500,0001,035,0002,113,536
8Sep 15, 2026 03:503,411122,835,201111,543,0001,033,0002,113,536
9Sep 15, 2026 03:503,429123,439,207112,147,0001,039,0002,113,536