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 listJul 23, 2026 21:10boop34boop34Score: 19,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 21:1119,542654,830,599639,920,0004,994,0002,113,536
2Jul 23, 2026 21:1119,580655,886,568640,964,0005,189,0002,113,536
3Jul 23, 2026 21:1119,607656,790,601641,850,0005,190,0002,113,536
4Jul 23, 2026 21:1119,633657,751,334642,760,0005,152,0002,113,536
5Jul 23, 2026 21:1119,661658,561,565643,758,0005,055,0002,113,536
6Jul 23, 2026 21:1119,896666,369,116651,327,0005,271,0002,113,536
7Jul 23, 2026 21:1120,018670,402,695655,600,0005,006,0002,113,536
8Jul 23, 2026 21:1120,728693,766,467678,950,0005,086,0002,113,536
9Jul 23, 2026 21:1120,779695,574,847680,767,0004,952,0002,113,536