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 listJul 30, 2026 19:21TonyTonyScore: 32,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 19:2232,335970,075,382904,882,00054,022,0002,138,112
2Jul 30, 2026 19:2232,344970,342,128905,486,00053,754,0002,138,112
3Jul 30, 2026 19:2232,364970,930,666904,689,00055,117,0002,138,112
4Jul 30, 2026 19:2232,372971,183,437905,809,00054,191,0002,138,112
5Jul 30, 2026 19:2232,373971,200,377905,082,00054,949,0002,138,112
6Jul 30, 2026 19:2232,399971,997,034905,772,00054,411,0002,138,112
7Jul 30, 2026 19:2232,410972,301,055906,598,00053,750,0002,138,112
8Jul 30, 2026 19:2232,470974,127,998907,519,00054,850,0002,138,112
9Jul 30, 2026 19:2232,484974,522,771904,613,00054,298,0002,138,112