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 11:12M-RochatM-RochatScore: 20,607Success
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 11:1320,134604,044,621589,466,0004,028,0002,113,536
2May 22, 2026 11:1320,273608,201,421594,442,0004,181,0002,113,536
3May 22, 2026 11:1320,348610,448,428596,765,0004,116,0002,113,536
4May 22, 2026 11:1320,353610,617,008596,689,0004,248,0002,113,536
5May 22, 2026 11:1320,607618,236,306601,780,0004,201,0002,113,536
6May 22, 2026 11:1320,614618,425,683603,601,0004,163,0002,113,536
7May 22, 2026 11:1320,746622,381,557606,987,0004,145,0002,113,536
8May 22, 2026 11:1320,751622,553,553607,594,0004,081,0002,113,536
9May 22, 2026 11:1320,839625,198,961610,841,0004,039,0002,113,536