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 16, 2026 14:53Dominique GarmierDominique GarmierScore: 12,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 14:1312,131363,915,736979,299,0008,993,0002,686,976
2Mar 16, 2026 14:1312,293368,788,872985,446,0009,994,0002,338,816
3Mar 16, 2026 14:5312,377371,306,779981,597,0008,987,0002,670,592
4Mar 16, 2026 14:5312,400371,996,1871,001,143,0008,983,0002,572,288
5Mar 16, 2026 14:5312,481374,436,484981,562,00012,967,0002,633,728
6Mar 16, 2026 14:1312,659379,781,961997,914,0008,981,0002,551,808