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 04:04Victor MerckléVictor MerckléScore: 3,328Success
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 04:053,30899,246,896258,770,0003,085,0002,654,208
2Jun 24, 2026 04:053,31499,441,448260,693,0003,111,0002,654,208
3Jun 24, 2026 04:053,32399,707,728262,254,0002,035,0002,654,208
4Jun 24, 2026 04:053,32699,795,343262,528,0003,080,0002,654,208
5Jun 24, 2026 04:053,32899,869,206261,685,0003,133,0002,650,112
6Jun 24, 2026 04:053,335100,077,297262,448,0003,033,0002,654,208
7Jun 24, 2026 04:053,336100,098,581262,948,0003,073,0002,654,208
8Jun 24, 2026 04:053,379101,383,776266,035,0003,093,0002,654,208
9Jun 24, 2026 04:053,413102,406,209268,208,0001,008,0002,650,112