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 listNov 5, 2026 17:21e1011e1011Score: 32,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 17:2432,668980,061,402937,369,00031,788,0002,113,536
2Nov 5, 2026 17:2432,701981,050,228938,545,00031,606,0002,113,536
3Nov 5, 2026 17:2432,709981,289,685938,068,00032,077,0002,113,536
4Nov 5, 2026 17:2432,732981,975,748939,134,00031,850,0002,113,536
5Nov 5, 2026 17:2432,751982,530,899940,032,00031,545,0002,113,536
6Nov 5, 2026 17:2432,757982,735,764940,251,00031,610,0002,113,536
7Nov 5, 2026 17:2432,764982,920,912939,872,00031,994,0002,113,536
8Nov 5, 2026 17:2432,790983,724,252939,994,00032,300,0002,113,536
9Nov 5, 2026 17:2432,801984,050,243941,417,00031,689,0002,113,536