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 21, 2026 17:18M-RochatM-RochatScore: 21,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:1921,285638,561,807624,760,0004,199,0002,113,536
2May 21, 2026 17:1921,458643,754,656628,675,0004,248,0002,113,536
3May 21, 2026 17:1921,604648,135,795634,213,0004,259,0002,113,536
4May 21, 2026 17:1921,720651,607,755635,950,0004,289,0002,113,536
5May 21, 2026 17:1921,812654,369,863638,680,0004,253,0002,113,536
6May 21, 2026 17:1921,893656,817,731640,242,0004,203,0002,113,536
7May 21, 2026 17:1922,114663,442,304647,850,0004,079,0002,113,536
8May 21, 2026 17:1922,208666,257,449649,619,0004,321,0002,113,536
9May 21, 2026 17:1922,266667,996,664650,756,0004,037,0002,113,536