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 09:48Andrew EpsteinAndrew EpsteinScore: 1,491Success
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 09:561,45343,612,47198,979,0001,211,0002,162,688stderr
2Oct 31, 2026 09:561,46043,819,27799,895,0001,174,0002,170,880stderr
3Oct 31, 2026 09:561,46744,031,284101,058,0001,037,0002,170,880stderr
4Oct 31, 2026 09:561,48244,486,595101,819,0001,159,0002,170,880stderr
5Oct 31, 2026 09:561,49144,736,440102,931,0001,187,0002,162,688stderr
6Oct 31, 2026 09:561,50345,095,658103,856,0001,108,0002,170,880stderr
7Oct 31, 2026 09:561,83555,071,868106,490,0002,041,0002,146,304stderr
8Oct 31, 2026 09:561,92757,835,268110,495,0001,025,0002,170,880stderr
9Oct 31, 2026 09:562,13464,045,802127,422,0003,042,0002,170,880stderr