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 13, 2026 15:48Dominique GarmierDominique GarmierScore: 44,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:4844,2741,328,232,1483,751,784,00037,987,0002,732,032
2Mar 13, 2026 15:4844,3791,331,361,3893,768,534,00032,987,0002,895,872
3Mar 13, 2026 15:4844,6381,339,128,9783,768,750,00034,979,0002,576,384
4Mar 13, 2026 15:4844,8481,345,440,7723,762,197,00030,976,0002,695,168
5Mar 13, 2026 15:4844,9181,347,529,1793,796,266,00033,966,0002,965,504
6Mar 13, 2026 15:4846,4431,393,300,7003,876,928,00036,970,0002,564,096
7Mar 13, 2026 15:4848,9721,469,159,9324,005,340,00034,985,0002,555,904
8Mar 13, 2026 15:4849,9121,497,362,1634,093,639,00031,965,0002,744,320
9Mar 13, 2026 15:4850,7841,523,531,9494,213,342,00033,954,0002,547,712