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 4, 2026 22:31olliecrowolliecrowScore: 13,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 22:3213,289398,688,690374,562,0009,375,0002,408,448
2May 4, 2026 22:3213,390401,719,723375,898,0009,809,0002,412,544
3May 4, 2026 22:3213,398401,965,018374,751,0009,846,0002,375,680
4May 4, 2026 22:3213,431402,939,114377,072,0009,821,0002,416,640
5May 4, 2026 22:3213,466403,981,298374,571,0009,400,0002,416,640
6May 4, 2026 22:3213,498404,951,221376,068,0009,796,0002,408,448
7May 4, 2026 22:3213,511405,358,112377,538,0009,647,0002,408,448
8May 4, 2026 22:3213,602408,087,724378,555,0009,613,0002,420,736
9May 4, 2026 22:3213,887416,629,943387,202,0009,862,0002,408,448