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 listMay 22, 2026 19:17M-RochatM-RochatScore: 28,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 19:1827,933838,002,623813,538,00014,810,0002,113,536
2May 22, 2026 19:1827,967839,012,987813,590,00015,020,0002,113,536
3May 22, 2026 19:1828,036841,095,118813,653,00014,944,0002,113,536
4May 22, 2026 19:1828,064841,939,231816,533,00015,432,0002,113,536
5May 22, 2026 19:1828,066841,997,016817,207,00014,884,0002,113,536
6May 22, 2026 19:1828,147844,432,876818,151,00014,974,0002,113,536
7May 22, 2026 19:1828,155844,651,393818,835,00014,888,0002,113,536
8May 22, 2026 19:1828,156844,709,137817,254,00017,030,0002,113,536
9May 22, 2026 19:1828,199845,980,127818,741,00015,061,0002,113,536