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 listOct 19, 2026 01:45highload-churnerhighload-churnerScore: 1,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 01:461,51345,412,761105,176,0001,204,000249,856stderr
2Oct 19, 2026 01:461,55346,607,191109,096,0001,017,000249,856stderr
3Oct 19, 2026 01:461,57347,203,087110,404,0001,011,000249,856stderr
4Oct 19, 2026 01:461,58047,416,864107,938,0001,205,000249,856stderr
5Oct 19, 2026 01:461,58047,419,046106,801,0001,189,000249,856stderr
6Oct 19, 2026 01:461,59747,913,953108,511,0001,205,000249,856stderr
7Oct 19, 2026 01:461,59847,964,502111,233,0001,012,000249,856stderr
8Oct 19, 2026 01:461,60048,002,253108,495,0001,015,000249,856stderr
9Oct 19, 2026 01:461,61448,448,545109,289,0001,189,000249,856stderr