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 3, 2026 14:27A_ShamanA_ShamanScore: 88,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 14:2987,2842,618,531,1422,566,763,00041,694,0002,117,632
2Jul 3, 2026 14:2987,3652,620,955,2112,568,927,00042,159,0002,117,632
3Jul 3, 2026 14:2987,6702,630,129,0532,578,953,00041,519,0002,113,536
4Jul 3, 2026 14:2987,8582,635,755,2312,584,235,00041,490,0002,113,536
5Jul 3, 2026 14:2988,1562,644,697,4492,592,498,00041,908,0002,113,536
6Jul 3, 2026 14:2988,4472,653,418,6222,601,623,00041,733,0002,117,632
7Jul 3, 2026 14:2988,5602,656,801,3012,605,044,00041,886,0002,117,632
8Jul 3, 2026 14:2988,5832,657,508,1272,605,780,00041,835,0002,113,536
9Jul 3, 2026 14:2988,7622,662,884,0232,610,960,00041,608,0002,117,632