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 listJun 24, 2026 02:59Victor MerckléVictor MerckléScore: 3,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 03:003,11293,375,608252,325,0003,113,0002,662,400
2Jun 24, 2026 03:003,13494,037,936254,411,0003,121,0002,662,400
3Jun 24, 2026 03:003,13594,050,371253,368,0003,089,0002,662,400
4Jun 24, 2026 03:003,13994,183,612254,949,0003,132,0002,658,304
5Jun 24, 2026 03:003,13994,199,027253,902,0003,026,0002,662,400
6Jun 24, 2026 03:003,14094,200,896254,507,0003,097,0002,658,304
7Jun 24, 2026 03:003,19295,773,055258,563,0003,102,0002,412,544
8Jun 24, 2026 03:003,22296,662,504257,971,0003,081,0002,662,400
9Jun 24, 2026 03:003,28898,660,051262,563,0003,110,0002,416,640