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 16, 2026 02:11Victor MerckléVictor MerckléScore: 4,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 02:124,520135,609,614372,552,0003,017,0002,326,528stderr
2Aug 16, 2026 02:124,583137,503,429379,088,0003,011,0002,306,048stderr
3Aug 16, 2026 02:124,858145,743,703403,460,0004,018,0002,260,992stderr
4Aug 16, 2026 02:124,869146,091,588402,988,0004,067,0002,260,992stderr
5Aug 16, 2026 02:124,880146,411,269403,512,0004,056,0002,637,824stderr
6Aug 16, 2026 02:124,913147,417,638406,775,0004,054,0002,306,048stderr
7Aug 16, 2026 02:124,927147,810,258409,244,0004,089,0002,523,136stderr
8Aug 16, 2026 02:124,927147,834,410406,538,0003,065,0002,494,464stderr
9Aug 16, 2026 02:124,963148,912,200412,778,0004,378,0002,465,792stderr