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 27, 2026 22:58TudyMTudyMScore: 11,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 23:0710,766322,993,943878,585,00016,991,0002,777,088
2Apr 27, 2026 23:0710,893326,795,153882,092,00015,001,0002,682,880
3Apr 27, 2026 23:0710,947328,421,520882,282,00014,004,0002,670,592
4Apr 27, 2026 23:0711,336340,085,061927,485,00020,988,0002,813,952
5Apr 27, 2026 23:0711,433342,995,714930,202,00016,967,0002,809,856
6Apr 27, 2026 23:0711,456343,687,584939,230,00012,989,0002,600,960
7Apr 27, 2026 23:0711,457343,739,225932,491,00017,970,0002,551,808
8Apr 27, 2026 23:0711,529345,887,047932,906,00015,981,0002,707,456
9Apr 27, 2026 23:0711,585347,561,646934,811,00013,997,0002,703,360