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 25, 2026 04:30Dominique GarmierDominique GarmierScore: 79,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 21:0778,6162,358,486,1722,319,274,00015,994,0002,633,728
2Mar 24, 2026 21:0779,2622,377,855,9122,337,609,00012,008,0002,658,304
3Mar 25, 2026 04:3079,3642,380,909,8542,337,352,00018,970,0002,400,256
4Mar 25, 2026 04:3079,5642,386,913,6032,349,694,00010,993,0002,404,352
5Mar 25, 2026 04:3079,6452,389,341,9642,348,120,00013,988,0002,404,352
6Mar 24, 2026 21:0780,1382,404,126,7612,356,402,00011,991,0002,338,816