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 listSep 15, 2026 02:10Josu San MartinJosu San MartinScore: 3,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 02:123,862115,862,379158,056,0002,101,0002,146,304
2Sep 15, 2026 02:123,866116,008,909158,668,0002,093,0002,146,304
3Sep 15, 2026 02:123,866115,980,507158,787,0002,099,0002,146,304
4Sep 15, 2026 02:123,868116,047,888158,504,0002,142,0002,146,304
5Sep 15, 2026 02:123,868116,062,535158,540,0002,092,0002,146,304
6Sep 15, 2026 02:123,879116,377,366159,109,0002,162,0002,146,304
7Sep 15, 2026 02:123,880116,400,669158,519,0002,144,0002,146,304
8Sep 15, 2026 02:123,890116,705,353159,018,0002,166,0002,146,304
9Sep 15, 2026 02:123,946118,388,153159,692,0002,097,0002,125,824