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 16, 2026 08:34M-RochatM-RochatScore: 31,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:3731,840955,208,231933,416,00012,996,0002,113,536
2May 16, 2026 08:3731,879956,376,217934,399,00012,910,0002,113,536
3May 16, 2026 08:3731,911957,353,578933,837,00012,591,0002,113,536
4May 16, 2026 08:3731,919957,596,384934,281,00012,839,0002,113,536
5May 16, 2026 08:3731,924957,740,976933,930,00012,702,0002,113,536
6May 16, 2026 08:3731,986959,586,654937,578,00013,052,0002,113,536
7May 16, 2026 08:3732,953988,605,641966,458,00013,333,0002,113,536
8May 16, 2026 08:3733,043991,306,326967,656,00013,055,0002,113,536
9May 16, 2026 08:3733,115993,468,072969,287,00013,744,0002,113,536