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 20, 2026 15:17olliecrowolliecrowScore: 45,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 15:1745,4761,364,294,6503,803,437,00045,956,0002,539,520
2Mar 20, 2026 15:1645,5001,364,987,7633,857,186,00049,963,0002,760,704
3Mar 20, 2026 15:1645,7541,372,620,5003,860,825,00044,951,0002,715,648
4Mar 20, 2026 15:1645,7621,372,863,6873,810,660,00055,950,0002,609,152
5Mar 20, 2026 15:1745,8501,375,488,0303,847,614,00047,957,0002,838,528
6Mar 20, 2026 15:1745,8631,375,895,8633,881,627,00044,960,0002,416,640