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 listOct 10, 2026 00:49highload-churnerhighload-churnerScore: 12,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 02:1312,134364,042,463305,018,00047,911,00024,576stderr
2Oct 10, 2026 02:1312,382371,470,138312,225,00048,035,00024,576stderr
3Oct 10, 2026 02:1312,395371,863,957312,082,00048,874,00024,576stderr
4Oct 10, 2026 02:1312,675380,267,846320,463,00049,310,00024,576stderr
5Oct 10, 2026 02:1312,729381,899,790321,927,00049,413,00024,576stderr
6Oct 10, 2026 02:1312,733382,008,012321,954,00049,505,00024,576stderr
7Oct 10, 2026 02:1312,792383,771,385323,281,00050,114,00024,576stderr
8Oct 10, 2026 02:1312,803384,105,303323,420,00050,168,00024,576stderr
9Oct 10, 2026 02:1312,973389,219,891328,654,00049,338,00024,576stderr