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 listMar 4, 2026 03:00olliecrowolliecrowScore: 10,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 03:009,946298,382,860768,196,00011,002,0002,523,136
2Mar 4, 2026 03:009,952298,546,444769,150,0009,988,0002,531,328
3Mar 4, 2026 03:009,967299,002,995771,814,0008,997,0002,441,216
4Mar 4, 2026 03:009,983299,479,963770,321,00010,976,0002,547,712
5Mar 4, 2026 03:0010,027300,797,568772,417,0008,993,0002,449,408
6Mar 4, 2026 03:0010,037301,122,598784,517,0008,983,0002,437,120
7Mar 4, 2026 03:0010,122303,660,090771,479,00012,007,0002,396,160
8Mar 4, 2026 03:0010,208306,234,711768,159,00010,987,0002,404,352
9Mar 4, 2026 03:0010,530315,890,153800,125,00010,001,0002,392,064