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 30, 2026 07:10Charles CabergsCharles CabergsScore: 11,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 07:1111,829354,876,296994,960,00012,960,0002,985,984
2Apr 30, 2026 07:1111,866356,006,6451,002,375,0009,983,0002,801,664
3Apr 30, 2026 07:1111,929357,892,9891,005,650,00012,982,0002,875,392
4Apr 30, 2026 07:1111,974359,235,2351,007,884,00011,963,0002,772,992
5Apr 30, 2026 07:1111,979359,387,3091,008,948,0008,981,0002,801,664
6Apr 30, 2026 07:1112,075362,257,9831,003,431,00010,971,0002,392,064
7Apr 30, 2026 07:1112,078362,364,5481,015,829,00010,976,0002,990,080
8Apr 30, 2026 07:1112,085362,563,5571,015,545,0008,987,0002,977,792
9Apr 30, 2026 07:1112,156364,697,7031,008,791,00010,965,0002,658,304