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 listAug 15, 2026 14:24Tomislav TunkovicTomislav TunkovicScore: 3,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 14:253,746131,981,511122,619,0001,006,00024,576
2Aug 15, 2026 14:253,756132,319,164122,833,0001,138,00024,576
3Aug 15, 2026 14:253,766132,598,388123,277,0001,009,00024,576
4Aug 15, 2026 14:253,767132,742,983123,331,0001,006,00024,576
5Aug 15, 2026 14:253,767132,721,541123,340,0001,002,00024,576
6Aug 15, 2026 14:253,769132,781,174123,376,0001,008,00024,576
7Aug 15, 2026 14:253,770132,805,185123,339,0001,079,00024,576
8Aug 15, 2026 14:253,775133,663,597123,590,0001,007,00024,576
9Aug 15, 2026 14:253,779133,030,549123,707,0001,007,00024,576