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 listAug 15, 2026 21:39Victor MerckléVictor MerckléScore: 4,738Success
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 21:404,671140,137,908382,778,0005,783,0002,519,040stderr
2Aug 15, 2026 21:404,699140,972,350385,460,0006,365,0002,527,232stderr
3Aug 15, 2026 21:404,714141,449,175388,007,0005,563,0002,527,232stderr
4Aug 15, 2026 21:404,737142,117,931384,332,0006,857,0002,465,792stderr
5Aug 15, 2026 21:404,738142,145,002384,957,0005,414,0002,527,232stderr
6Aug 15, 2026 21:404,747142,436,174389,035,0005,546,0002,396,160stderr
7Aug 15, 2026 21:404,752142,575,789388,909,0005,692,0002,523,136stderr
8Aug 15, 2026 21:404,753142,604,418387,409,0005,748,0002,543,616stderr
9Aug 15, 2026 21:404,754142,647,298387,147,0005,780,0002,527,232stderr