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 listFeb 22, 2026 20:09SneedSneedScore: 84,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 20:0983,7322,797,536,9682,752,165,00010,992,0002,293,760
2Feb 22, 2026 20:0984,0702,805,502,8742,759,305,00014,990,0002,285,568
3Feb 22, 2026 20:0984,2432,812,134,5232,767,022,00012,995,0002,277,376
4Feb 22, 2026 20:0984,2622,807,491,7042,769,644,00010,994,0002,293,760
5Feb 22, 2026 20:0984,6012,824,542,3592,778,852,00012,994,0002,285,568
6Feb 22, 2026 20:0984,7052,829,910,4882,781,287,00013,991,0002,400,256
7Feb 22, 2026 20:0984,9702,836,764,4942,790,015,00013,990,0002,465,792
8Feb 22, 2026 20:0985,3482,840,486,8442,798,481,00017,990,0002,285,568
9Feb 22, 2026 20:0988,2502,939,686,0232,899,268,00012,992,0002,473,984