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 01:42Andrew EpsteinAndrew EpsteinScore: 1,609Success
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 01:431,57647,307,680100,696,0001,032,0002,166,784stderr
2Oct 31, 2026 01:431,58447,526,485103,023,0002,018,0002,424,832stderr
3Oct 31, 2026 01:431,58647,597,240101,655,0002,020,0002,420,736stderr
4Oct 31, 2026 01:431,59647,887,499102,358,0001,038,0002,166,784stderr
5Oct 31, 2026 01:431,60948,281,205102,510,0001,051,0002,166,784stderr
6Oct 31, 2026 01:431,62048,623,037104,262,0002,030,0002,428,928stderr
7Oct 31, 2026 01:431,62248,689,192104,030,0002,022,0002,428,928stderr
8Oct 31, 2026 01:431,63649,083,504103,974,0002,019,0002,424,832stderr
9Oct 31, 2026 01:431,63849,140,050106,218,0001,046,0002,166,784stderr