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:36Andrew EpsteinAndrew EpsteinScore: 1,490Success
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:441,45243,569,66398,994,0001,195,0002,162,688stderr
2Oct 31, 2026 06:441,46844,049,839100,519,0001,237,0002,170,880stderr
3Oct 31, 2026 06:441,47944,388,918101,904,0001,235,0002,162,688stderr
4Oct 31, 2026 06:441,48644,585,472102,388,0001,118,0002,170,880stderr
5Oct 31, 2026 06:441,49044,715,756102,593,0001,120,0002,170,880stderr
6Oct 31, 2026 06:441,49444,822,631102,870,0001,138,0002,162,688stderr
7Oct 31, 2026 06:441,51445,445,902104,457,0001,225,0002,162,688stderr
8Oct 31, 2026 06:441,51645,509,348104,922,0001,009,0002,170,880stderr
9Oct 31, 2026 06:441,54046,213,420102,248,0001,025,0002,170,880stderr