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 01:42Victor MerckléVictor MerckléScore: 1,954Success
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 01:461,87656,283,035137,595,0001,010,0002,170,880stderr
2Aug 18, 2026 01:461,88156,445,972137,920,0001,008,0002,170,880stderr
3Aug 18, 2026 01:461,88656,601,642140,051,0001,247,0002,170,880stderr
4Aug 18, 2026 01:461,90257,065,677139,838,0002,006,0002,170,880stderr
5Aug 18, 2026 01:461,95458,636,097142,584,0001,008,0002,170,880stderr
6Aug 18, 2026 01:461,95458,646,763143,256,0001,009,0002,170,880stderr
7Aug 18, 2026 01:461,96659,003,212145,202,0001,010,0002,170,880stderr
8Aug 18, 2026 01:461,98259,477,608145,742,0001,006,0002,170,880stderr
9Aug 18, 2026 01:461,99559,870,898148,758,0002,274,0002,170,880stderr