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 listSep 1, 2026 09:59Victor MerckléVictor MerckléScore: 1,778Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 10:001,74652,384,834125,752,0002,015,0002,170,880stderr
2Sep 1, 2026 10:001,74952,480,201125,977,0002,016,0002,170,880stderr
3Sep 1, 2026 10:001,76452,924,391126,329,0001,025,0002,170,880stderr
4Sep 1, 2026 10:001,76853,058,803125,460,0002,043,0002,170,880stderr
5Sep 1, 2026 10:001,77853,361,614125,345,0002,005,0002,170,880stderr
6Sep 1, 2026 10:001,78353,507,230126,043,0001,028,0002,170,880stderr
7Sep 1, 2026 10:001,78553,558,803125,048,0002,032,0002,170,880stderr
8Sep 1, 2026 10:001,79453,825,045126,327,0001,037,0002,170,880stderr
9Sep 1, 2026 10:001,80454,141,123126,810,0001,038,0002,170,880stderr