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 12:52Victor MerckléVictor MerckléScore: 5,479Success
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 12:535,463163,919,594455,521,0003,124,0002,174,976stderr
2Aug 31, 2026 12:535,466163,982,413455,767,0003,088,0002,174,976stderr
3Aug 31, 2026 12:535,472164,165,082455,649,0003,077,0002,174,976stderr
4Aug 31, 2026 12:535,478164,355,117455,598,0002,089,0002,174,976stderr
5Aug 31, 2026 12:535,479164,386,818455,238,0002,103,0002,174,976stderr
6Aug 31, 2026 12:535,499164,983,149458,740,0002,092,0002,174,976stderr
7Aug 31, 2026 12:535,503165,110,393457,457,0002,107,0002,174,976stderr
8Aug 31, 2026 12:535,510165,302,367459,423,0003,140,0002,174,976stderr
9Aug 31, 2026 12:535,528165,860,624458,727,0002,102,0002,174,976stderr