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 listJul 31, 2025 00:12Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 141,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2025 00:12140,5594,664,961,2064,495,536,000142,921,0002,277,376
2Jul 31, 2025 00:12141,2384,692,728,1304,527,941,000132,910,0002,371,584
3Jul 31, 2025 00:12141,3494,698,890,1764,513,624,000150,887,0002,277,376
4Jul 31, 2025 00:12141,5334,702,148,5714,521,688,000148,890,0002,433,024
5Jul 31, 2025 00:12141,8844,715,624,8084,525,264,000156,905,0002,277,376
6Jul 31, 2025 00:12141,8944,708,139,5014,544,566,000137,926,0002,277,376
7Jul 31, 2025 00:12142,5254,730,795,4844,546,402,000156,910,0002,424,832
8Jul 31, 2025 00:12142,6284,735,367,1524,558,781,000147,928,0002,277,376
9Jul 31, 2025 00:12143,9074,780,239,4794,605,040,000143,907,0002,433,024