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 9, 2026 08:27Pavel SkripkinPavel SkripkinScore: 75,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 08:2774,9032,502,263,2152,432,804,00038,980,0002,478,080
2Jan 9, 2026 08:2774,9082,499,871,9482,433,991,00037,984,0002,281,472
3Jan 9, 2026 08:2774,9782,498,366,0362,436,298,00037,973,0002,437,120
4Jan 9, 2026 08:2774,9782,502,313,8542,435,301,00038,972,0002,473,984
5Jan 9, 2026 08:2775,0342,500,430,2752,438,133,00037,986,0002,281,472
6Jan 9, 2026 08:2775,4542,521,859,2492,451,994,00037,984,0002,420,736
7Jan 9, 2026 08:2775,5292,520,918,1332,454,478,00037,976,0002,482,176
8Jan 9, 2026 08:2775,8392,528,552,2582,465,712,00036,980,0002,473,984
9Jan 9, 2026 08:2775,9262,531,288,9432,466,578,00038,977,0002,478,080