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 13, 2025 08:30Ian MckibbenIan MckibbenScore: 30,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 08:3030,3861,032,579,824875,763,000126,965,0002,326,528
2Jan 13, 2025 08:3030,4321,028,512,993869,346,000134,898,0002,334,720
3Jan 13, 2025 08:3030,4911,029,058,018854,317,000151,878,0002,351,104
4Jan 13, 2025 08:3030,5081,034,216,839868,791,000137,966,0002,449,408
5Jan 13, 2025 08:3030,5541,031,635,031874,370,000133,903,0002,322,432
6Jan 13, 2025 08:3030,5961,032,287,873860,730,000148,953,0002,326,528
7Jan 13, 2025 08:3030,6101,036,858,121870,111,000140,017,0002,326,528
8Jan 13, 2025 08:3030,6201,044,633,249877,538,000132,930,0002,330,624
9Jan 13, 2025 08:3030,6351,040,087,198842,961,000167,992,0002,461,696