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 04:16e1011e1011Score: 156,971Success
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 04:17151,8375,021,544,0855,008,354,0002,293,0002,113,536
2Oct 17, 2026 04:17153,2955,070,079,8655,054,590,0004,153,0002,113,536
3Oct 17, 2026 04:17155,0665,128,660,5855,115,200,0002,003,0002,113,536
4Oct 17, 2026 04:17155,1005,129,764,9945,116,068,0002,239,0002,113,536
5Oct 17, 2026 04:17156,9715,190,943,0855,177,782,0002,268,0002,113,536
6Oct 17, 2026 04:17158,2895,235,035,3465,221,536,0002,006,0002,113,536
7Oct 17, 2026 04:17160,3005,301,735,7775,286,747,0003,163,0002,113,536
8Oct 17, 2026 04:17164,9105,453,252,9945,438,777,0003,271,0002,113,536
9Oct 17, 2026 04:17166,1715,494,544,7605,481,419,0002,254,0002,113,536