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 3, 2026 23:57olliecrowolliecrowScore: 10,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:5710,615318,441,834843,081,0009,977,0002,392,064
2Mar 3, 2026 23:5710,627318,795,159842,487,0008,983,0002,609,152
3Mar 3, 2026 23:5710,758322,730,038851,283,00010,965,0002,670,592
4Mar 3, 2026 23:5710,777323,321,427853,699,0008,996,0002,502,656
5Mar 3, 2026 23:5710,792323,754,101857,954,0009,987,0002,347,008
6Mar 3, 2026 23:5710,798323,950,373851,146,0009,989,0002,408,448
7Mar 3, 2026 23:5710,935328,051,522845,400,0009,981,0002,613,248
8Mar 3, 2026 23:5710,971329,131,675852,049,00010,987,0002,396,160
9Mar 3, 2026 23:5711,278338,341,872882,101,00012,001,0002,686,976