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 listAug 31, 2026 10:31Victor MerckléVictor MerckléScore: 1,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 10:311,67350,195,625118,569,0002,030,0002,170,880stderr
2Aug 31, 2026 10:311,67550,276,396118,981,0002,022,0002,170,880stderr
3Aug 31, 2026 10:311,67650,286,084119,076,0002,015,0002,170,880stderr
4Aug 31, 2026 10:311,68150,446,908119,329,0002,020,0002,170,880stderr
5Aug 31, 2026 10:311,68350,507,697119,976,0001,026,0002,170,880stderr
6Aug 31, 2026 10:311,69050,706,005120,899,0002,014,0002,170,880stderr
7Aug 31, 2026 10:311,69550,856,201119,935,0002,007,0002,170,880stderr
8Aug 31, 2026 10:311,70451,135,223119,491,0001,031,0002,170,880stderr
9Aug 31, 2026 10:311,71351,402,104119,918,0001,033,0002,170,880stderr