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 18, 2026 01:59M-RochatM-RochatScore: 22,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 02:0120,790623,720,451607,637,0004,104,0002,113,536
2May 18, 2026 02:0120,869626,083,726610,455,0004,133,0002,113,536
3May 18, 2026 02:0121,328639,857,868625,896,0004,012,0002,113,536
4May 18, 2026 02:0122,061661,849,027648,310,0004,096,0002,113,536
5May 18, 2026 02:0122,089662,672,000647,458,0004,015,0002,113,536
6May 18, 2026 02:0122,091662,742,387648,496,0004,036,0002,113,536
7May 18, 2026 02:0122,106663,187,043647,187,0004,058,0002,113,536
8May 18, 2026 02:0122,141664,256,706648,342,0004,071,0002,113,536
9May 18, 2026 02:0122,177665,325,786649,682,0004,051,0002,113,536