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 listMar 10, 2026 05:28olliecrowolliecrowScore: 9,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:289,610288,300,473676,594,00021,986,0002,744,320
2Mar 10, 2026 05:289,636289,083,344674,642,00022,987,0002,613,248
3Mar 10, 2026 05:289,646289,392,467673,894,00019,996,0002,994,176
4Mar 10, 2026 05:289,728291,850,121675,121,00023,933,0002,781,184
5Mar 10, 2026 05:289,752292,564,500672,930,00022,963,0002,732,032
6Mar 10, 2026 05:289,796293,876,712671,588,00022,019,0002,740,224