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 26, 2026 02:07Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 02:08089,395,269239,200,0003,107,0002,658,304expected "1025766 ", got "1025765 "
2Jun 26, 2026 02:08088,414,333237,689,0003,039,0002,662,400expected "1019083 ", got "1019082 "
3Jun 26, 2026 02:082,95088,512,864237,651,0003,162,0002,662,400
4Jun 26, 2026 02:082,95588,651,122238,204,0003,160,0002,662,400
5Jun 26, 2026 02:082,96388,898,839238,890,0003,056,0002,662,400
6Jun 26, 2026 02:082,96789,026,640239,233,0003,141,0002,662,400
7Jun 26, 2026 02:082,96789,012,326238,975,0003,176,0002,662,400
8Jun 26, 2026 02:083,02590,757,243240,846,0003,103,0002,662,400
9Jun 26, 2026 02:083,03090,926,839240,548,0003,058,0002,662,400