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 06:35Andrew EpsteinAndrew EpsteinScore: 1,472Success
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 06:421,45543,665,699100,674,0001,036,0002,162,688stderr
2Oct 31, 2026 06:421,46243,860,983100,565,0001,268,0002,150,400stderr
3Oct 31, 2026 06:421,46343,896,812100,951,0001,019,0002,162,688stderr
4Oct 31, 2026 06:421,46643,985,300101,420,0001,036,0002,158,592stderr
5Oct 31, 2026 06:421,47244,187,913102,024,0001,044,0002,162,688stderr
6Oct 31, 2026 06:421,47244,164,868101,654,0001,223,0002,154,496stderr
7Oct 31, 2026 06:421,48144,444,663102,506,0001,036,0002,170,880stderr
8Oct 31, 2026 06:421,50345,103,543104,504,0001,036,0002,150,400stderr
9Oct 31, 2026 06:421,51045,313,062105,464,0001,014,0002,162,688stderr