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 9, 2026 23:41Victor MerckléVictor MerckléScore: 3,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 23:423,06892,065,999242,953,0001,021,0002,138,112
2Jun 9, 2026 23:423,07792,310,415240,215,0003,037,0002,138,112
3Jun 9, 2026 23:423,08392,513,051241,949,0002,143,0002,138,112
4Jun 9, 2026 23:423,09592,862,756243,929,0001,020,0002,138,112
5Jun 9, 2026 23:423,16094,806,554243,779,0002,141,0002,138,112
6Jun 9, 2026 23:423,18095,402,975247,222,0001,007,0002,138,112
7Jun 9, 2026 23:423,18495,531,973246,246,0001,122,0002,138,112
8Jun 9, 2026 23:423,18595,550,016247,667,0002,027,0002,138,112
9Jun 9, 2026 23:423,22396,713,922246,575,0003,138,0002,138,112