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 16:55boop34boop34Score: 12,109Success
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 16:5612,088408,745,679390,173,0008,758,0002,113,536
2Jul 23, 2026 16:5612,093408,804,054389,914,0009,159,0002,113,536
3Jul 23, 2026 16:5612,096408,922,216390,434,0008,738,0002,113,536
4Jul 23, 2026 16:5612,096408,904,690390,094,0009,106,0002,113,536
5Jul 23, 2026 16:5612,109409,413,542390,924,0008,676,0002,113,536
6Jul 23, 2026 16:5612,133410,668,059391,471,0008,940,0002,113,536
7Jul 23, 2026 16:5612,133410,186,723391,219,0009,180,0002,113,536
8Jul 23, 2026 16:5612,134410,226,804391,570,0008,875,0002,113,536
9Jul 23, 2026 16:5612,135410,306,988391,367,0009,102,0002,113,536