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 listMay 17, 2026 10:39M-RochatM-RochatScore: 21,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 10:4321,450643,509,633627,669,0005,168,0002,129,920
2May 17, 2026 10:4321,566646,994,404630,737,0005,187,0002,129,920
3May 17, 2026 10:4321,631648,957,581631,721,0006,187,0002,129,920
4May 17, 2026 10:4321,722651,661,861634,595,0005,192,0002,129,920
5May 17, 2026 10:4321,822654,682,051637,246,0006,159,0002,129,920
6May 17, 2026 10:4321,840655,227,002637,730,0005,179,0002,129,920
7May 17, 2026 10:4322,209666,279,663648,446,0006,158,0002,129,920
8May 17, 2026 10:4322,342670,272,367652,640,0006,150,0002,129,920
9May 17, 2026 10:4323,264697,927,533681,668,0006,187,0002,129,920