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 19, 2026 02:11highload-churnerhighload-churnerScore: 1,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 02:121,50845,241,141104,853,0001,212,000249,856stderr
2Oct 19, 2026 02:121,53145,942,032107,059,0001,216,000249,856stderr
3Oct 19, 2026 02:121,53346,016,201107,555,0001,009,000249,856stderr
4Oct 19, 2026 02:121,53646,088,070106,975,0002,076,000249,856stderr
5Oct 19, 2026 02:121,55146,538,657108,487,0001,242,000249,856stderr
6Oct 19, 2026 02:121,55546,651,973109,077,0001,012,000249,856stderr
7Oct 19, 2026 02:121,56046,808,224109,624,0001,010,000249,856stderr
8Oct 19, 2026 02:121,57347,200,337110,282,0002,086,000249,856stderr
9Oct 19, 2026 02:121,62248,677,639111,227,0001,027,000249,856stderr