Unique strings Sergey Svistunov

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 listJan 11, 2025 00:40Ian MckibbenIan MckibbenScore: 78,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 00:4077,3492,582,340,1032,530,522,00021,987,0002,347,008
2Jan 11, 2025 00:4077,7602,596,794,9062,539,113,00026,979,0002,326,528
3Jan 11, 2025 00:4078,1132,615,680,1972,557,731,00019,990,0002,293,760
4Jan 11, 2025 00:4078,2582,611,320,9592,558,539,00023,986,0002,342,912
5Jan 11, 2025 00:4078,3402,607,757,0452,565,230,00019,986,0002,293,760
6Jan 11, 2025 00:4078,6602,624,163,1592,567,805,00027,976,0002,342,912
7Jan 11, 2025 00:4078,6832,618,829,9522,575,562,00020,988,0002,371,584
8Jan 11, 2025 00:4078,9702,633,965,9982,586,036,00019,984,0002,342,912
9Jan 11, 2025 00:4080,2962,676,631,2172,622,790,00026,987,0002,342,912