Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listApr 22, 2026 06:36olliecrowolliecrowScore: 17,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 06:3716,966508,993,7321,425,474,00011,003,0002,646,016
2Apr 22, 2026 06:3717,046511,382,1401,424,810,00010,998,0002,953,216
3Apr 22, 2026 06:3717,073512,190,9561,427,197,0009,994,0002,531,328
4Apr 22, 2026 06:3717,118513,564,4221,426,189,00010,986,0002,596,864
5Apr 22, 2026 06:3717,152514,568,3341,463,796,0009,984,0002,629,632
6Apr 22, 2026 06:3717,721531,637,6941,501,857,0009,992,0002,813,952
7Apr 22, 2026 06:3717,917537,531,4121,498,165,00010,979,0002,572,288
8Apr 22, 2026 06:3717,938538,151,4121,499,263,00010,987,0002,809,856
9Apr 22, 2026 06:3717,951538,531,0751,499,906,0009,979,0002,658,304