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 listJun 7, 2026 21:16anboto1anboto1Score: 25,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 21:1925,734859,295,792842,978,0006,263,0002,113,536
2Jun 7, 2026 21:1925,805860,947,360845,300,0006,280,0002,113,536
3Jun 7, 2026 21:1925,834861,902,224846,265,0006,260,0002,113,536
4Jun 7, 2026 21:1925,882865,506,212847,595,0006,523,0002,113,536
5Jun 7, 2026 21:1925,915864,980,950848,860,0006,342,0002,113,536
6Jun 7, 2026 21:1925,963866,608,668850,481,0006,312,0002,113,536
7Jun 7, 2026 21:1926,015867,889,175852,160,0006,339,0002,113,536
8Jun 7, 2026 21:1926,083870,048,660854,335,0006,435,0002,113,536
9Jun 7, 2026 21:1926,099870,656,196855,018,0006,259,0002,113,536