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 listOct 17, 2026 03:54e1011e1011Score: 239,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 03:56237,3647,844,179,8067,830,023,0003,008,0002,113,536
2Oct 17, 2026 03:56237,4557,847,149,8027,832,992,0003,026,0002,113,536
3Oct 17, 2026 03:56238,2537,873,267,4257,860,151,0002,201,0002,113,536
4Oct 17, 2026 03:56238,4437,879,621,2867,866,402,0002,221,0002,113,536
5Oct 17, 2026 03:56239,0737,900,994,0397,887,413,0002,001,0002,113,536
6Oct 17, 2026 03:56239,5667,917,323,9667,903,682,0002,010,0002,113,536
7Oct 17, 2026 03:56243,1948,036,375,5868,023,225,0002,178,0002,113,536
8Oct 17, 2026 03:56245,1788,101,819,3338,088,782,0002,121,0002,113,536
9Oct 17, 2026 03:56247,4608,177,342,2248,163,983,0002,203,0002,113,536