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 listJun 6, 2026 14:48Victor MerckléVictor MerckléScore: 3,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 14:493,427102,818,822270,708,0002,172,0002,142,208
2Jun 6, 2026 14:493,434103,022,362271,100,0002,202,0002,142,208
3Jun 6, 2026 14:493,459103,781,706273,044,0002,166,0002,142,208
4Jun 6, 2026 14:493,465103,963,523273,368,0002,180,0002,142,208
5Jun 6, 2026 14:493,466104,000,950272,577,0001,162,0002,146,304
6Jun 6, 2026 14:493,469104,080,699274,046,0002,171,0002,142,208
7Jun 6, 2026 14:493,472104,160,773273,565,0002,175,0002,142,208
8Jun 6, 2026 14:493,474104,235,678273,587,0002,158,0002,142,208
9Jun 6, 2026 14:493,504105,135,848277,659,0001,018,0002,142,208