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 18, 2026 15:19Victor MerckléVictor MerckléScore: 2,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 15:211,98159,434,167145,810,0002,015,0002,170,880stderr
2Aug 18, 2026 15:212,00060,023,238147,759,0002,009,0002,170,880stderr
3Aug 18, 2026 15:212,00660,186,658147,020,0001,007,0002,170,880stderr
4Aug 18, 2026 15:212,01660,507,720149,858,0002,039,0002,170,880stderr
5Aug 18, 2026 15:212,01860,548,359145,944,0001,044,0002,170,880stderr
6Aug 18, 2026 15:212,02160,648,345149,681,0002,024,0002,170,880stderr
7Aug 18, 2026 15:212,03260,967,973146,795,0001,041,0002,170,880stderr
8Aug 18, 2026 15:212,05061,512,312151,282,0001,004,0002,170,880stderr
9Aug 18, 2026 15:212,09262,772,801149,258,0001,020,0002,170,880stderr