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 listApr 29, 2026 14:16TudyMTudyMScore: 11,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:1710,674320,249,922859,789,00018,995,0002,621,440
2Apr 29, 2026 14:1710,698320,954,369860,040,00018,000,0002,621,440
3Apr 29, 2026 14:1710,778323,361,091861,607,00018,012,0002,822,144
4Apr 29, 2026 14:1710,833324,997,594867,554,00016,991,0002,801,664
5Apr 29, 2026 14:1711,170335,119,359918,191,00016,985,0002,568,192
6Apr 29, 2026 14:1711,209336,278,542866,129,00015,036,0002,551,808
7Apr 29, 2026 14:1711,234337,025,538921,462,00011,993,0002,805,760
8Apr 29, 2026 14:1711,317339,535,123914,909,00018,998,0002,637,824
9Apr 29, 2026 14:1711,345340,371,728916,620,00015,975,0002,646,016