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:18Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 141,653Success
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:18138,5524,600,098,0794,479,266,00092,943,0002,277,376
2Jul 31, 2025 00:18139,9104,648,847,5344,508,107,000108,930,0002,277,376
3Jul 31, 2025 00:18140,4494,668,623,8334,527,880,000106,926,0002,424,832
4Jul 31, 2025 00:18140,4584,665,872,0504,536,162,00098,938,0002,478,080
5Jul 31, 2025 00:18141,6534,703,528,6164,569,608,000104,945,0002,490,368
6Jul 31, 2025 00:18141,6634,704,446,2414,574,938,00099,954,0002,277,376
7Jul 31, 2025 00:18141,7594,708,328,9294,576,087,000101,957,0002,277,376
8Jul 31, 2025 00:18142,3664,728,469,8914,598,146,00099,937,0002,277,376
9Jul 31, 2025 00:18142,8284,742,416,9234,598,381,000114,934,0002,482,176