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 23, 2026 02:46olliecrowolliecrowScore: 6,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 02:475,946178,394,017448,513,0008,970,0002,801,664
2Apr 23, 2026 02:475,985179,556,879436,906,00010,020,0002,654,208
3Apr 23, 2026 02:476,018180,548,493438,755,0008,994,0002,584,576
4Apr 23, 2026 02:476,045181,362,447438,849,0008,996,0002,781,184
5Apr 23, 2026 02:476,054181,647,625441,675,0009,970,0002,752,512
6Apr 23, 2026 02:476,060181,816,260449,916,0008,978,0002,519,040
7Apr 23, 2026 02:476,097182,927,570449,248,0008,984,0002,592,768
8Apr 23, 2026 02:476,109183,276,338439,124,0008,982,0002,347,008
9Apr 23, 2026 02:476,163184,913,737437,151,00010,003,0002,797,568