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 listJun 7, 2026 21:42anboto1anboto1Score: 11,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 21:4611,483388,805,526366,077,00012,889,0002,117,632
2Jun 7, 2026 21:4611,492389,100,107366,660,00012,594,0002,117,632
3Jun 7, 2026 21:4611,567391,492,840368,664,00013,050,0002,117,632
4Jun 7, 2026 21:4611,577391,669,078369,301,00012,754,0002,117,632
5Jun 7, 2026 21:4611,773397,871,283375,189,00013,333,0002,117,632
6Jun 7, 2026 21:4611,798400,132,799376,868,00012,479,0002,117,632
7Jun 7, 2026 21:4611,898401,940,275379,405,00013,247,0002,117,632
8Jun 7, 2026 21:4611,918402,912,518379,938,00013,356,0002,117,632
9Jun 7, 2026 21:4611,981404,789,813381,996,00013,390,0002,117,632