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:20Dominique GarmierDominique GarmierScore: 44,670Success
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:2044,1751,325,261,8513,735,112,00037,990,0002,527,232
2Mar 13, 2026 15:2044,2011,326,038,5473,726,951,00036,979,0002,555,904
3Mar 13, 2026 15:2044,4381,333,143,2603,766,536,00036,985,0002,936,832
4Mar 13, 2026 15:2044,5671,337,007,4223,798,591,00034,959,0002,760,704
5Mar 13, 2026 15:2044,6701,340,085,7483,802,542,00038,954,0002,727,936
6Mar 13, 2026 15:2049,6181,488,553,9664,039,754,00039,987,0002,752,512
7Mar 13, 2026 15:2049,7681,493,054,4244,070,684,00040,946,0002,785,280
8Mar 13, 2026 15:2050,6281,518,834,4884,139,903,00032,967,0002,805,760
9Mar 13, 2026 15:2051,0591,531,763,5974,156,973,00031,984,0002,555,904