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 listDec 15, 2025 16:13Pavitra GolchhaPavitra GolchhaScore: 68,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 16:1368,4582,290,488,3922,118,155,000140,943,0002,285,568
2Dec 15, 2025 16:1368,5202,288,365,4592,117,271,000143,882,0002,285,568
3Dec 15, 2025 16:1368,5242,297,040,7502,120,401,000140,893,0002,285,568
4Dec 15, 2025 16:1368,6932,293,116,8022,122,928,000143,927,0002,285,568
5Dec 15, 2025 16:1368,7152,292,472,5992,123,700,000143,911,0002,359,296
6Dec 15, 2025 16:1368,8872,306,062,2612,131,375,000141,891,0002,285,568
7Dec 15, 2025 16:1368,8892,305,295,6262,130,428,000142,894,0002,322,432
8Dec 15, 2025 16:1369,6202,331,318,3052,153,563,000143,903,0002,347,008
9Dec 15, 2025 16:1369,8612,337,131,8872,163,497,000141,901,0002,285,568