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 20:14olliecrowolliecrowScore: 7,158Success
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 20:156,960208,827,632544,411,0006,015,0002,973,696
2Apr 21, 2026 20:157,033211,016,315542,563,0007,978,0002,719,744
3Apr 21, 2026 20:157,039211,174,629543,441,0005,982,0002,752,512
4Apr 21, 2026 20:157,150214,502,068545,563,0004,996,0002,703,360
5Apr 21, 2026 20:157,158214,759,742544,010,0006,000,0002,588,672
6Apr 21, 2026 20:157,182215,486,701545,761,0004,988,0002,715,648
7Apr 21, 2026 20:157,210216,302,562547,116,0005,979,0002,674,688
8Apr 21, 2026 20:157,265217,958,675546,759,0004,988,0002,703,360
9Apr 21, 2026 20:157,325219,768,745545,464,0004,995,0002,723,840