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 30, 2026 01:52Charles CabergsCharles CabergsScore: 12,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 01:5311,886356,581,5801,001,670,0009,996,0002,658,304
2Apr 30, 2026 01:5312,003360,108,7121,009,560,00010,995,0002,969,600
3Apr 30, 2026 01:5312,038361,158,3661,019,069,0006,993,0002,396,160
4Apr 30, 2026 01:5312,105363,160,6891,016,449,00010,983,0002,985,984
5Apr 30, 2026 01:5312,110363,309,9481,005,227,0007,001,0003,031,040
6Apr 30, 2026 01:5312,124363,721,2881,010,183,00013,974,0002,801,664
7Apr 30, 2026 01:5312,127363,837,1731,028,892,0007,991,0002,981,888
8Apr 30, 2026 01:5312,133364,001,4211,012,577,00015,993,0002,805,760
9Apr 30, 2026 01:5312,308369,260,9921,032,065,0009,981,0002,523,136