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 21, 2026 06:27olliecrowolliecrowScore: 6,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 06:276,855205,651,093502,057,00010,021,0002,404,352
2Apr 21, 2026 06:276,857205,716,947502,066,0008,983,0002,306,048
3Apr 21, 2026 06:276,921207,648,302498,769,00010,972,0002,400,256
4Apr 21, 2026 06:276,929207,874,560509,233,0009,004,0002,396,160
5Apr 21, 2026 06:276,949208,478,648515,961,00010,977,0002,756,608
6Apr 21, 2026 06:277,115213,469,777516,783,0009,995,0002,351,104
7Apr 21, 2026 06:277,154214,626,958501,334,00010,006,0002,297,856
8Apr 21, 2026 06:277,157214,714,090500,290,00011,983,0002,498,560
9Apr 21, 2026 06:277,219216,595,800515,046,00011,001,0002,646,016