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 listJan 11, 2026 08:05Pavel SkripkinPavel SkripkinScore: 58,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 08:0558,1151,940,064,4031,911,798,0005,996,0002,367,488
2Jan 11, 2026 08:0558,2691,947,456,7751,916,872,0005,996,0002,465,792
3Jan 11, 2026 08:0558,3001,948,579,5771,916,914,0006,996,0002,457,600
4Jan 11, 2026 08:0558,5631,959,686,9201,925,580,0006,994,0002,281,472
5Jan 11, 2026 08:0558,5941,966,813,3241,926,594,0006,994,0002,289,664
6Jan 11, 2026 08:0558,6541,963,887,5011,928,594,0006,994,0002,285,568
7Jan 11, 2026 08:0558,9051,967,710,8571,937,854,0005,996,0002,285,568
8Jan 11, 2026 08:0559,0901,974,936,6791,942,959,0006,996,0002,355,200
9Jan 11, 2026 08:0560,3862,014,629,1041,985,734,0006,995,0002,289,664