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 26, 2026 18:14TudyMTudyMScore: 29,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:1528,288848,656,1721,755,233,00051,977,0002,863,104
2Apr 26, 2026 18:1528,824864,739,5541,791,717,00048,937,0002,551,808
3Apr 26, 2026 18:1529,110873,319,3641,811,109,00049,975,0002,727,936
4Apr 26, 2026 18:1529,188875,646,8321,801,774,00048,966,0002,670,592
5Apr 26, 2026 18:1529,433882,996,9751,838,711,00045,967,0002,875,392
6Apr 26, 2026 18:1529,546886,403,9311,836,343,00045,958,0002,490,368
7Apr 26, 2026 18:1529,767893,011,0661,858,318,00051,952,0002,699,264
8Apr 26, 2026 18:1531,070932,101,8511,976,556,00048,939,0002,699,264
9Apr 26, 2026 18:1531,076932,284,1991,976,149,00055,891,0002,678,784