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 19:44M-RochatM-RochatScore: 20,337Success
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 19:4519,836595,094,371582,563,0004,048,0002,117,632
2May 22, 2026 19:4520,015600,479,482586,245,0004,044,0002,117,632
3May 22, 2026 19:4520,234607,034,267593,760,0004,060,0002,117,632
4May 22, 2026 19:4520,304609,134,242596,532,0004,104,0002,117,632
5May 22, 2026 19:4520,337610,121,320595,128,0004,099,0002,117,632
6May 22, 2026 19:4520,835625,052,084610,195,0004,123,0002,117,632
7May 22, 2026 19:4521,549646,493,232632,943,0004,049,0002,117,632
8May 22, 2026 19:4521,576647,292,081635,341,0004,029,0002,117,632
9May 22, 2026 19:4521,619648,575,371633,446,0004,207,0002,117,632