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 listMar 4, 2026 07:28olliecrowolliecrowScore: 7,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 07:286,981209,424,586508,682,00010,993,0002,584,576
2Mar 4, 2026 07:287,051211,542,149512,940,0007,983,0002,650,112
3Mar 4, 2026 07:287,094212,829,807510,854,0009,977,0002,334,720
4Mar 4, 2026 07:287,119213,576,310511,538,00011,011,0002,658,304
5Mar 4, 2026 07:287,136214,079,898508,987,00010,978,0002,375,680
6Mar 4, 2026 07:287,159214,777,428509,075,00012,001,0002,445,312
7Mar 4, 2026 07:287,161214,815,556519,061,0009,962,0002,768,896
8Mar 4, 2026 07:287,171215,117,202510,791,0009,976,0002,396,160
9Mar 4, 2026 07:287,195215,847,524516,513,0009,952,0002,592,768