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 22, 2025 00:41Gerard SmitGerard SmitScore: 163,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 00:41162,7105,404,489,1275,349,451,00019,986,0002,461,696
2Jan 22, 2025 00:41163,1425,421,171,5145,358,711,00024,984,0002,494,464
3Jan 22, 2025 00:41163,2075,412,419,8855,364,854,00020,987,0002,486,272
4Jan 22, 2025 00:41163,3865,421,264,7275,368,762,00022,986,0002,441,216
5Jan 22, 2025 00:41163,6805,431,940,9865,377,445,00023,984,0002,400,256
6Jan 22, 2025 00:41164,3825,461,373,8485,393,623,00030,980,0002,445,312
7Jan 22, 2025 00:41168,2195,582,881,3015,521,259,00029,979,0002,412,544
8Jan 22, 2025 00:41168,8085,601,977,7875,542,692,00027,983,0002,437,120
9Jan 22, 2025 00:41187,2916,209,303,4816,156,608,00023,982,0002,301,952