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 03:58Andrew EpsteinAndrew EpsteinScore: 1,510Success
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 04:051,49444,844,346103,159,0001,201,0002,166,784
2Oct 31, 2026 04:051,49844,963,330103,140,0001,149,0002,166,784
3Oct 31, 2026 04:051,50445,136,243104,041,0001,101,0002,166,784
4Oct 31, 2026 04:051,50845,265,154104,361,0001,170,0002,166,784
5Oct 31, 2026 04:051,51045,321,844104,460,0001,207,0002,166,784
6Oct 31, 2026 04:051,51545,450,125104,728,0001,182,0002,158,592
7Oct 31, 2026 04:051,52045,628,149105,574,0001,069,0002,166,784
8Oct 31, 2026 04:051,53145,937,232106,658,0001,156,0002,158,592
9Oct 31, 2026 04:051,53245,980,816106,269,0001,177,0002,166,784