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 17:15boop34boop34Score: 13,166Success
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 17:1613,086441,689,824426,735,0005,128,0002,113,536
2Jul 23, 2026 17:1613,087441,680,010427,003,0004,877,0002,113,536
3Jul 23, 2026 17:1613,114442,671,450427,647,0005,136,0002,113,536
4Jul 23, 2026 17:1613,125442,899,277428,081,0005,046,0002,113,536
5Jul 23, 2026 17:1613,166444,264,043429,562,0004,940,0002,113,536
6Jul 23, 2026 17:1613,173444,628,999429,712,0005,006,0002,113,536
7Jul 23, 2026 17:1613,198445,366,907430,482,0005,066,0002,113,536
8Jul 23, 2026 17:1613,209445,738,391430,796,0005,103,0002,113,536
9Jul 23, 2026 17:1613,232446,725,982431,676,0005,003,0002,117,632