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 7, 2026 04:37Victor 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 7, 2026 04:380111,870,088292,530,0005,458,0002,400,256expected "1023457 ", got "1023456 "
2Jun 7, 2026 04:383,568107,061,672278,671,0005,506,0002,473,984
3Jun 7, 2026 04:383,587107,624,643279,012,0006,069,0002,428,928
4Jun 7, 2026 04:383,603108,112,025281,695,0005,044,0002,400,256
5Jun 7, 2026 04:383,618108,553,559282,139,0006,020,0002,297,856
6Jun 7, 2026 04:383,651109,538,763284,883,0005,501,0002,424,832
7Jun 7, 2026 04:383,660109,808,583285,019,0005,549,0002,506,752
8Jun 7, 2026 04:383,725111,772,343292,579,0006,427,0002,560,000
9Jun 7, 2026 04:383,740112,229,601293,902,0006,364,0002,543,616