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:50Victor MerckléVictor MerckléScore: 1,688Success
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:511,67350,215,848118,350,0002,036,0002,170,880stderr
2Aug 31, 2026 10:511,67450,223,540117,078,0001,015,0002,170,880stderr
3Aug 31, 2026 10:511,67450,229,432118,327,0002,020,0002,170,880stderr
4Aug 31, 2026 10:511,67650,282,569117,495,0001,024,0002,170,880stderr
5Aug 31, 2026 10:511,68850,660,000118,320,0001,025,0002,170,880stderr
6Aug 31, 2026 10:511,68850,666,777120,024,0001,024,0002,170,880stderr
7Aug 31, 2026 10:511,68950,683,821119,361,0001,041,0002,170,880stderr
8Aug 31, 2026 10:511,70151,044,158118,923,0002,035,0002,170,880stderr
9Aug 31, 2026 10:511,70351,110,742120,566,0002,011,0002,170,880stderr