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 listApr 27, 2026 13:59Victor MerckléVictor MerckléScore: 26,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 14:0025,595767,853,497711,775,00036,988,0002,539,520
2Apr 27, 2026 14:0025,804774,126,565725,963,00032,998,0002,764,800
3Apr 27, 2026 14:0025,816774,490,654720,105,00035,005,0002,301,952
4Apr 27, 2026 14:0025,832774,982,132725,687,00031,986,0002,539,520
5Apr 27, 2026 14:0026,219786,573,393734,661,00034,983,0002,347,008
6Apr 27, 2026 14:0026,317789,538,602731,235,00039,958,0002,543,616
7Apr 27, 2026 14:0026,341790,240,571736,648,00036,982,0002,555,904
8Apr 27, 2026 14:0026,485794,557,215737,688,00032,986,0002,543,616
9Apr 27, 2026 14:0026,540796,208,712739,285,00037,963,0002,777,088