Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 31, 2026 10:08Andrew EpsteinAndrew EpsteinScore: 1,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 10:131,51445,447,04497,918,0002,050,0002,179,072stderr
2Oct 31, 2026 10:131,53846,145,93899,981,0002,053,0002,179,072stderr
3Oct 31, 2026 10:131,54746,419,801100,786,0002,031,0002,191,360stderr
4Oct 31, 2026 10:131,55146,542,545101,416,0002,054,0002,191,360stderr
5Oct 31, 2026 10:131,55346,613,135101,325,0002,039,0002,179,072stderr
6Oct 31, 2026 10:131,55646,705,355102,954,0001,011,0002,183,168stderr
7Oct 31, 2026 10:131,55646,704,273101,509,0002,032,0002,224,128stderr
8Oct 31, 2026 10:131,55646,691,312101,522,0002,058,0002,179,072stderr
9Oct 31, 2026 10:131,55946,778,692102,025,0002,024,0002,179,072stderr