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 3, 2025 00:32tkaltkalScore: 247,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 00:32246,7568,174,270,9308,024,024,000118,926,0002,510,848
2Jan 3, 2025 00:32247,5308,203,660,6668,055,582,000112,924,0002,363,392
3Jan 3, 2025 00:32247,8178,217,034,6948,068,024,000109,932,0002,269,184
4Jan 3, 2025 00:32247,9008,209,728,3478,073,761,000106,930,0002,449,408
5Jan 3, 2025 00:32247,9238,213,950,9398,068,520,000112,937,0002,428,928
6Jan 3, 2025 00:32248,4798,235,872,7598,072,903,000126,919,0002,469,888
7Jan 3, 2025 00:32249,1188,260,312,4028,108,975,000111,930,0002,449,408
8Jan 3, 2025 00:32249,1278,262,051,2718,113,240,000107,936,0002,523,136
9Jan 3, 2025 00:32249,7378,278,775,6308,126,400,000114,920,0002,420,736