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:48TudyMTudyMScore: 11,516Success
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 22:5711,165334,973,326907,875,00031,960,0002,539,520
2Apr 27, 2026 22:5711,219336,587,940894,431,00035,977,0002,646,016
3Apr 27, 2026 22:5711,371341,149,579935,992,00027,999,0002,760,704
4Apr 27, 2026 22:5711,460343,811,886934,380,00027,981,0002,670,592
5Apr 27, 2026 22:5711,516345,500,104934,234,00028,976,0002,564,096
6Apr 27, 2026 22:5711,520345,627,139943,360,00024,983,0002,691,072
7Apr 27, 2026 22:5711,533346,010,219931,583,00031,985,0002,912,256
8Apr 27, 2026 22:5711,545346,370,186929,985,00033,962,0002,588,672
9Apr 27, 2026 22:5711,653349,608,051935,663,00027,960,0002,572,288