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:38Andrew EpsteinAndrew EpsteinScore: 1,544Success
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:421,51645,495,70099,315,0001,008,0002,179,072stderr
2Oct 31, 2026 10:421,52045,624,11798,610,0002,037,0002,179,072stderr
3Oct 31, 2026 10:421,53045,921,74799,593,0002,036,0002,179,072stderr
4Oct 31, 2026 10:421,53846,167,133100,344,0002,037,0002,179,072stderr
5Oct 31, 2026 10:421,54446,342,236100,515,0002,064,0002,179,072stderr
6Oct 31, 2026 10:421,54846,455,096101,298,0002,011,0002,179,072stderr
7Oct 31, 2026 10:421,54946,494,626101,441,0002,023,0002,232,320stderr
8Oct 31, 2026 10:421,55646,696,681101,868,0002,112,0002,179,072stderr
9Oct 31, 2026 10:421,55846,744,870101,998,0002,041,0002,179,072stderr