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 30, 2026 02:26Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 02:28092,276,390234,105,0003,250,0002,707,456expected "1026166 ", got "1026165 "
2Jun 30, 2026 02:282,93187,936,344233,210,0003,038,0002,707,456
3Jun 30, 2026 02:282,93387,992,768232,307,0003,537,0002,707,456
4Jun 30, 2026 02:282,96989,096,499233,221,0003,212,0002,707,456
5Jun 30, 2026 02:283,02190,630,076234,262,0003,237,0002,707,456
6Jun 30, 2026 02:283,04291,289,109231,218,0003,118,0002,707,456
7Jun 30, 2026 02:283,06591,951,785233,980,0004,184,0002,707,456
8Jun 30, 2026 02:283,08092,409,789235,537,0003,232,0002,707,456
9Jun 30, 2026 02:283,08192,452,515234,853,0003,314,0002,707,456