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 22:31TudyMTudyMScore: 15,124Success
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 22:4014,782443,482,6841,248,374,00026,964,0002,560,000
2Apr 27, 2026 22:4014,976449,305,1791,246,292,00029,958,0002,707,456
3Apr 27, 2026 22:4014,998449,957,5541,237,812,00034,966,0003,010,560
4Apr 27, 2026 22:4015,097452,926,4731,237,674,00036,990,0002,514,944
5Apr 27, 2026 22:4015,124453,724,0941,234,955,00037,058,0002,772,992
6Apr 27, 2026 22:4015,163454,907,3801,237,893,00031,971,0002,596,864
7Apr 27, 2026 22:4015,210456,304,3701,284,807,00030,947,0002,789,376
8Apr 27, 2026 22:4015,229456,891,9531,281,459,00029,963,0002,506,752
9Apr 27, 2026 22:4015,309459,296,9571,283,059,00025,960,0002,777,088